Abstract
Heap-based data structures play an important role in modern programming concepts. However standard verification algorithms cannot cope with infinite state spaces as induced by these structures. A common approach to solve this problem is to apply abstraction techniques. Hyperedge replacement grammars provide a promising technique for heap abstraction as their production rules can be used to partially abstract and concretise heap structures. To support the required concretisations, we introduce a normal form for hyperedge replacement grammars as a generalisation of the Greibach Normal Form for string grammars and the adapted construction. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Jansen, C., Heinen, J., Katoen, J. P., & Noll, T. (2011). A local Greibach normal form for hyperedge replacement grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 323–335). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
