A tool for intersecting context-free grammars and its applications

Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

3 Citations (Scopus)

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 languageEnglish
Title of host publicationNASA Formal Methods
Subtitle of host publication7th International Symposium, NFM 2015 Pasadena, CA, USA, April 27–29, 2015 Proceedings
EditorsKlaus Havelund, Gerard Holzmann, Rajeev Joshi
Place of PublicationCham Switzerland
PublisherSpringer
Pages422-428
Number of pages7
ISBN (Electronic)9783319175249
ISBN (Print)9783319175232
DOIs
Publication statusPublished - 2015
Externally publishedYes
EventNASA Formal Methods Symposium (NFM) 2015 - Pasadena, United States of America
Duration: 27 Apr 201529 Apr 2015
Conference number: 7th
https://web.archive.org/web/20150124212932/http://nasaformalmethods.org/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume9058
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceNASA Formal Methods Symposium (NFM) 2015
Abbreviated titleNFM 2015
Country/TerritoryUnited States of America
CityPasadena
Period27/04/1529/04/15
Internet address

Cite this