Generating Abstract Graph-Based Procedure Summaries for Pointer Programs

DOI10.1007/978-3-319-09108-2_4zbMath1423.68100OpenAlexW61963352MaRDI QIDQ3192222

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

hypergraphsheap abstractionhyperedge replacement grammarsinterprocedural dataflow analysisprocedure contracts

Mathematics Subject Classification ID

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

Related Items (1)

Juggrnaut: using graph grammars for abstracting unbounded heap structures

This page was built for publication: Generating Abstract Graph-Based Procedure Summaries for Pointer Programs