Shape Analysis by Graph Decomposition

DOI10.1007/978-3-540-71209-1_3MaRDI QIDQ5758098zbMATH OpenOpenAlexFDO

Authors Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv

Publication date 3 September 2007

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71209-1_3

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A shape graph logic and a shape system
• Shape Analysis for Composite Data Structures
• A Shape Analysis for Non-linear Data Structures
• Graph-based shape analysis beyond context-freeness
• Monotonic abstraction for programs with multiply-linked structures

Cited in

(9)

• Decomposition of complex shapes for their structural recognition
• A divide-and-conquer approach for analysing overlaid data structures
• Monotonic abstraction for programs with multiply-linked structures
• Bottom-Up Shape Analysis
• Shape neutral analysis of graph-based data-structures
• A Shape Analysis for Non-linear Data Structures
• A shape analysis for optimizing parallel graph programs
• Graph-based shape analysis beyond context-freeness
• A shape graph logic and a shape system

This page was built for publication: Shape Analysis by Graph Decomposition

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