Abstract
This paper describes a tool for intersecting context-free grammars. Since this problem is undecidable the tool follows a refinement-based approach and implements a novel refinement which is complete for regularly separable grammars. We show its effectiveness for safety verification of recursive multi-threaded programs.
Original language | English |
---|---|
Title of host publication | NASA Formal Methods |
Subtitle of host publication | 7th International Symposium, NFM 2015 Pasadena, CA, USA, April 27–29, 2015 Proceedings |
Editors | Klaus Havelund, Gerard Holzmann, Rajeev Joshi |
Place of Publication | Cham Switzerland |
Publisher | Springer |
Pages | 422-428 |
Number of pages | 7 |
ISBN (Electronic) | 9783319175249 |
ISBN (Print) | 9783319175232 |
DOIs | |
Publication status | Published - 2015 |
Externally published | Yes |
Event | NASA Formal Methods Symposium (NFM) 2015 - Pasadena, United States of America Duration: 27 Apr 2015 → 29 Apr 2015 Conference number: 7th https://web.archive.org/web/20150124212932/http://nasaformalmethods.org/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 9058 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | NASA Formal Methods Symposium (NFM) 2015 |
---|---|
Abbreviated title | NFM 2015 |
Country/Territory | United States of America |
City | Pasadena |
Period | 27/04/15 → 29/04/15 |
Internet address |