Beyond Shapes: Lists with Ordered Data
From MaRDI portal
Recommendations
- Quantitative Separation Logic and Programs with Lists
- Quantitative separation logic and programs with lists
- The effects of adding reachability predicates in propositional separation logic
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- The tree width of separation logic with recursive definitions
Cites work
- Automated Verification of Shape and Size Properties Via Separation Logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 1617328 (Why is no real title available?)
- scientific article; zbMATH DE number 2081098 (Why is no real title available?)
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- On the Almighty Wand
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Programs with Lists Are Counter Automata
- Refinement-Based Verification for Possibly-Cyclic Lists
- Static Analysis
Cited in
(6)
This page was built for publication: Beyond Shapes: Lists with Ordered Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617745)