A local greibach normal form for hyperedge replacement grammars

Authors:
Christina Jansen;Jonathan Heinen;Joost-Pieter Katoen;Thomas Noll
Affiliations:
Software Modeling and Verification Group, RWTH Aachen University, Germany;Software Modeling and Verification Group, RWTH Aachen University, Germany;Software Modeling and Verification Group, RWTH Aachen University, Germany;Software Modeling and Verification Group, RWTH Aachen University, Germany
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 15
Cited 1

Boundary NLC graph grammars--basic definitions, normal forms, and complexity

Information and Control
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Greibach Normal Form for Context-free Graph Grammars

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Separation and information hiding

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Normal forms for context-free node-rewriting hypergraph grammars

Mathematical Structures in Computer Science
Abstracting Complex Data Structures by Hyperedge Replacement

ICGT '08 Proceedings of the 4th international conference on Graph Transformations
From Separation Logic to Hyperedge Replacement and Back

ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Several aspects of context freeness for hyperedge replacement grammars

WSEAS Transactions on Computers
Abstract Regular Tree Model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract Graph Transformation

Electronic Notes in Theoretical Computer Science (ENTCS)
Juggrnaut: Graph Grammar Abstraction for Unbounded Heap Structures

Electronic Notes in Theoretical Computer Science (ENTCS)
Safety and liveness in concurrent pointer programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects

Juggrnaut: an abstract JVM

FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software

Quantified Score

Hi-index	0.00

Visualization

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.