Abstracting Complex Data Structures by Hyperedge Replacement

DOI10.1007/978-3-540-87405-8_6zbMath1175.68124OpenAlexW1581724171MaRDI QIDQ3540389

Stefan Rieger, Thomas Noll

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_6

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Data structures (68P05)

Related Items (2)

Synthesis for Structure Rewriting Systems ⋮ Juggrnaut: using graph grammars for abstracting unbounded heap structures

Uses Software

• GROOVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separation and information hiding
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Handbook of Graph Grammars and Computing by Graph Transformation
• A Greibach normal form for context-free graph grammars
• Programming Languages and Systems
• CONCUR 2004 - Concurrency Theory
• Programming Languages and Systems
• Automated Deduction – CADE-20
• Static Analysis
• Static Analysis
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation
• Relational and Kleene-Algebraic Methods in Computer Science
• Static Analysis

This page was built for publication: Abstracting Complex Data Structures by Hyperedge Replacement