A decidable fragment of separation logic

Authors:
Josh Berdine;Cristiano Calcagno;Peter W. O’Hearn
Affiliations:
Queen Mary, University of London;Imperial College, London;Queen Mary, University of London
Venue:
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2004

Citing 6
Cited 46

Automatic verification of pointer programs using monadic second-order logic

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
A Decidable Logic for Describing Linked Data Structures

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Computability and Complexity Results for a Spatial Assertion Language for Data Structures

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Local Reasoning about Programs that Alter Data Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Separation and information hiding

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Verifying properties of well-founded linked lists

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types, bytes, and separation logic

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resources, concurrency, and local reasoning

Theoretical Computer Science
Shape analysis with inductive recursion synthesis

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Back to the future: revisiting precise program verification using SMT solvers

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Overview of Separation Logic

Verified Software: Theories, Tools, Experiments
On the Almighty Wand

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Formal Verification of C Systems Code

Journal of Automated Reasoning
Size does matter: two certified abstractions to disprove entailment in intuitionistic and classical separation logic

International Workshop on Aliasing, Confinement and Ownership in Object-Oriented Programming
A Logic-Based Framework for Reasoning about Composite Data Structures

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Semantics of fractional permissions with nesting

ACM Transactions on Programming Languages and Systems (TOPLAS)
An inference-rule-based decision procedure for verification of heap-manipulating programs with mutable data and cyclic data structures

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
On flat programs with lists

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
On model checking boolean BI

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Quantitative Separation Logic and Programs with Lists

Journal of Automated Reasoning
Abstraction of object graphs in program verification

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Decidable logics combining heap structures and data

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extended alias type system using separating implication

Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Separation logic + superposition calculus = heap theorem prover

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Tractable reasoning in a fragment of separation logic

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Efficient decision procedures for heaps using STRAND

SAS'11 Proceedings of the 18th international conference on Static analysis
Compositional Shape Analysis by Means of Bi-Abduction

Journal of the ACM (JACM)
Safety and liveness in concurrent pointer programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Interprocedural shape analysis with separated heap abstractions

SAS'06 Proceedings of the 13th international conference on Static Analysis
A logic of reachable patterns in linked data-structures

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Symbolic execution with separation logic

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Recursive proofs for inductive tree data-structures

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal verification of the heap manager of an operating system using separation logic

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
On the almighty wand

Information and Computation
Programs with lists are counter automata

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
From separation logic to first-order logic

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Bounded model checking of pointer programs

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A local shape analysis based on separation logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
ILC: a foundation for automated reasoning about pointer programs

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Automated verification of recursive programs with pointers

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Juggrnaut: an abstract JVM

FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
Locality in reasoning about graph transformations

AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
Accurate invariant checking for programs manipulating lists and arrays with infinite data

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Transitive separation logic

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
A theorem prover for Boolean BI

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compositional invariant checking for overlaid and nested linked lists

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Natural proofs for structure, data, and separation

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
The tree width of separation logic with recursive definitions

CADE'13 Proceedings of the 24th international conference on Automated Deduction
Automating separation logic using SMT

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
SeLoger: a tool for graph-based reasoning in separation logic

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
A proof system for separation logic with magic wand

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the stylized form of reasoning done in example program proofs. The fragment includes a predicate for describing linked list segments (a kind of reachability or transitive closure). Decidability is first proved by semantic means: by showing a small model property that bounds the size of potential countermodels that must be checked. We then provide a complete proof system for the fragment, the termination of which furnishes a second decision procedure.