Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-17524-9_31 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
context free grammar,context free languages,greedy algorithms,grammars | Stochastic context-free grammar,Context-sensitive grammar,Tree-adjoining grammar,L-attributed grammar,Programming language,Context-free grammar,Definite clause grammar,Computer science,Theoretical computer science,Parsing expression grammar,Ambiguous grammar | Conference |
Volume | ISSN | Citations |
9058 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 9 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Graeme Gange | 1 | 137 | 24.27 |
| Jorge A. Navas | 2 | 157 | 9.88 |
| Peter Schachte | 3 | 256 | 22.76 |
| Harald Søndergaard | 4 | 858 | 79.52 |
| Peter J. Stuckey | 5 | 4368 | 457.58 |