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.
Cite
CITATION STYLE
Gange, G., Navas, J. A., Schachte, P., Søndergaard, H., & Stuckey, P. J. (2015). A tool for intersecting context-free grammars and its applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9058, pp. 422–428). Springer Verlag. https://doi.org/10.1007/978-3-319-17524-9_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
