Monotonic abstraction for programs with multiply-linked structures

DOI10.1007/978-3-642-24288-5_12zbMATH Open1348.68114OpenAlexW2203901048MaRDI QIDQ3172870FDOQ3172870

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

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

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

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)

Cited In (3)

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

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)