Abstracting Complex Data Structures by Hyperedge Replacement
From MaRDI portal
Recommendations
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- A Local Greibach Normal Form for Hyperedge Replacement Grammars
- Generating abstract graph-based procedure summaries for pointer programs
- From Separation Logic to Hyperedge Replacement and Back
- Generating inductive predicates for symbolic execution of pointer-manipulating programs
Cites work
- A Greibach normal form for context-free graph grammars
- Abstract graph transformation
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Automated Deduction – CADE-20
- CONCUR 2004 - Concurrency Theory
- Extending C for checking shape safety
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 1953039 (Why is no real title available?)
- scientific article; zbMATH DE number 2016064 (Why is no real title available?)
- Programming Languages and Systems
- Programming Languages and Systems
- Relational and Kleene-Algebraic Methods in Computer Science
- Separation and information hiding
- Static Analysis
- Static Analysis
- Static Analysis
- Static Analysis
- Verification, Model Checking, and Abstract Interpretation
Cited in
(4)
This page was built for publication: Abstracting Complex Data Structures by Hyperedge Replacement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540389)
