Refinement-Based Verification for Possibly-Cyclic Lists

DOI10.1007/978-3-540-71322-7_12zbMATH Open1149.68356OpenAlexW1751880929MaRDI QIDQ3593077FDOQ3593077

Authors: Alexey Loginov, Mooly Sagiv, Thomas Reps 

Publication date: 24 September 2007

Published in: Program Analysis and Compilation, Theory and Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71322-7_12

Recommendations

• Verifying properties of well-founded linked lists
• Tools and Algorithms for the Construction and Analysis of Systems
• Programs with Lists Are Counter Automata
• scientific article; zbMATH DE number 1696591
• Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer Programs

Mathematics Subject Classification ID

Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (1)

• Beyond Shapes: Lists with Ordered Data

This page was built for publication: Refinement-Based Verification for Possibly-Cyclic Lists

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