Monotonic abstraction for programs with multiply-linked structures

DOI10.1007/978-3-642-24288-5_12MaRDI QIDQ3172870zbMATH OpenOpenAlexFDO

Authors Jonathan Cederberg, Tomáš Vojnar, Parosh A. Abdulla

Publication date 7 October 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-24288-5_12

Mathematics Subject Classification ID

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

Recommendations

• Monotonic abstraction for programs with multiply-linked structures
• Monotonic Abstraction for Programs with Dynamic Memory Heaps
• Verification, Model Checking, and Abstract Interpretation
• Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
• Shape Analysis by Graph Decomposition

Cited in

(4)

• Shape Analysis by Graph Decomposition
• Monotonic Abstraction for Programs with Dynamic Memory Heaps
• Monotonic abstraction for programs with multiply-linked structures
• Abstract interface behavior of object-oriented languages with monitors

This page was built for publication: Monotonic abstraction for programs with multiply-linked structures

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