A Decidable Fragment of Separation Logic
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Verification via Structure SimulationLecture Notes in Computer Science, 2004
- Separation and information hidingPublished by Association for Computing Machinery (ACM) ,2004
- Computability and Complexity Results for a Spatial Assertion Language for Data StructuresLecture Notes in Computer Science, 2001
- Local Reasoning about Programs that Alter Data StructuresLecture Notes in Computer Science, 2001
- BI as an assertion language for mutable data structuresPublished by Association for Computing Machinery (ACM) ,2001
- A Decidable Logic for Describing Linked Data StructuresLecture Notes in Computer Science, 1999
- Automatic verification of pointer programs using monadic second-order logicACM SIGPLAN Notices, 1997
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969