Beyond Shapes: Lists with Ordered Data

DOI10.1007/978-3-642-00596-1_30zbMath1234.68083OpenAlexW1485199833MaRDI QIDQ3617745

Etienne Lozes, Kshitij Bansal, Rémi Brochenin

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_30

Mathematics Subject Classification ID

Logic in computer science (03B70) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Separation logics and modalities: a survey ⋮ Two-Variable Separation Logic and Its Inner Circle ⋮ On the almighty wand ⋮ Reasoning about sequences of memory states

Uses Software

• HIP
• Smallfoot
• TVLA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• On the Almighty Wand
• Refinement-Based Verification for Possibly-Cyclic Lists
• Automated Verification of Shape and Size Properties Via Separation Logic
• Static Analysis
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Programs with Lists Are Counter Automata
• Foundations of Software Science and Computation Structures

This page was built for publication: Beyond Shapes: Lists with Ordered Data