Monotonic abstraction for programs with multiply-linked structures

DOI10.1142/S0129054113400078MaRDI QIDQ2841994zbMATH OpenFDO

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

Publication date 30 July 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054113400078

zbMATH Keywords

dynamic multiply-linked data structuresmonotonic abstractionprogram verificationshape analysis

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Monotonic abstraction for programs with multiply-linked structures
• Monotonic Abstraction for Programs with Dynamic Memory Heaps
• Tools and Algorithms for the Construction and Analysis of Systems
• Monotonic abstraction in parameterized verification
• MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
• Lazy constrained monotonic abstraction
• Non-monotonic refinement of control abstraction for concurrent programs
• On structuring functional programs with monoidal profunctors
• Monotonic Abstraction in Action
• Lost in abstraction: monotonicity in multi-threaded programs

Cites work

• Well (and better) quasi-ordered transition systems

Cited in

(3)

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

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 Q2841994)