On the Almighty Wand

DOI10.1007/978-3-540-87531-4_24zbMath1157.03010OpenAlexW1505383182MaRDI QIDQ3540188

Rémi Brochenin, Stéphane P. Demri, Etienne Lozes

Publication date: 20 November 2008

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_24

zbMATH Keywords

complexitysecond-order logicsatisfiabilityexpressive powerseparation logicreasoning on linked lists

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (9)

Separation logics and modalities: a survey ⋮ Proof tactics for assertions in separation logic ⋮ On the almighty wand ⋮ Reasoning about sequences of memory states ⋮ On the Almighty Wand ⋮ Quantitative separation logic and programs with lists ⋮ Separating Graph Logic from MSO ⋮ Beyond Shapes: Lists with Ordered Data ⋮ Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressiveness and complexity of graph logic
• Elimination of spatial connectives in static spatial logics
• Tableaux and Resource Graphs for Separation Logic
• On the Almighty Wand
• Quantitative Separation Logic and Programs with Lists
• Arithmetic Strengthening for Shape Analysis
• On the Expressive Power of Graph Logic
• BI as an assertion language for mutable data structures
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Reasoning About Sequences of Memory States
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Static Analysis
• Static Analysis
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Tools and Algorithms for the Construction and Analysis of Systems
• Foundations of Software Science and Computational Structures
• Foundations of Software Science and Computation Structures

This page was built for publication: On the Almighty Wand