Generating abstract graph-based procedure summaries for pointer programs

DOI10.1007/978-3-319-09108-2_4MaRDI QIDQ3192222zbMATH OpenOpenAlexFDO

Authors Christina Jansen, Thomas Noll

Publication date 26 September 2014

Published in Graph Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09108-2_4

zbMATH Keywords

heap abstractionhyperedge replacement grammarshypergraphsinterprocedural dataflow analysisprocedure contracts

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Juggrnaut: using graph grammars for abstracting unbounded heap structures
• Abstracting Complex Data Structures by Hyperedge Replacement
• Programming Languages and Systems
• Automatic numeric abstractions for heap-manipulating programs
• Generating inductive predicates for symbolic execution of pointer-manipulating programs

Cited in

(4)

• Generating precise and concise procedure summaries
• Generating inductive predicates for symbolic execution of pointer-manipulating programs
• Abstracting Complex Data Structures by Hyperedge Replacement
• Juggrnaut: using graph grammars for abstracting unbounded heap structures

This page was built for publication: Generating abstract graph-based procedure summaries for pointer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192222)