Symbolic execution with 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:
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Year:
2005

Citing 12
Cited 76

BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The pointer assertion logic engine

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Data abstraction and information hiding

ACM Transactions on Programming Languages and Systems (TOPLAS)
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Alias Types for Recursive Data Structures

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
Local Reasoning about Programs that Alter Data Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
On bunched typing

Journal of Functional Programming
A semantics for procedure local heaps and its abstractions

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
L3: a linear language with locations

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A decidable fragment of separation logic

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Shape analysis with inductive recursion synthesis

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Thread-modular shape analysis

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
A program logic for resources

Theoretical Computer Science
Cyclic proofs of program termination in separation logic

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cooperative reasoning for automatic software verification

Proceedings of the second workshop on Automated formal methods
Local reasoning about a copying garbage collector

ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning About Sequences of Memory States

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Enhancing Program Verification with Lemmas

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Scalable Shape Analysis for Systems Code

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Diagrammatic Reasoning in Separation Logic

Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
jStar: towards practical verification for java

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Lightweight Separation

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Compositional shape analysis by means of bi-abduction

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abductive Inference for Reasoning about Heaps

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Separation Logic Tutorial

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Automatic Parallelization with Separation Logic

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
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
Automatic Parallelization and Optimization of Programs by Proof Rewriting

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Separation Logic Verification of C Programs with an SMT Solver

Electronic Notes in Theoretical Computer Science (ENTCS)
Attacking Large Industrial Code with Bi-abductive Inference

FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Bi-abductive Resource Invariant Synthesis

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Verifying safety properties of concurrent heap-manipulating programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated verification of shape and size properties via separation logic

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Shape analysis for composite data structures

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Verifying pointer safety for programs with unknown calls

Journal of Symbolic Computation
A shape analysis for non-linear data structures

SAS'10 Proceedings of the 17th international conference on Static analysis
Symbolic and analytic techniques for resource analysis of java bytecode

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Calling context abstraction with shapes

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linear maps

Proceedings of the 5th ACM workshop on Programming languages meets program verification
Extended alias type system using separating implication

Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Matching logic: an alternative to hoare/floyd logic

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Access analysis-based tight localization of abstract memories

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
A quick tour of the VeriFast program verifier

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Separation logic + superposition calculus = heap theorem prover

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Annotation inference for separation logic based verifiers

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
SLAYER: memory safety for systems-level code

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
The complexity of abduction for separated heap abstractions

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

Journal of the ACM (JACM)
Mutation in linked data structures

ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Smallfoot: modular automatic assertion checking with separation logic

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Safety and liveness in concurrent pointer programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Beyond reachability: shape abstraction in the presence of pointer arithmetic

SAS'06 Proceedings of the 13th international conference on Static Analysis
Interprocedural shape analysis with separated heap abstractions

SAS'06 Proceedings of the 13th international conference on Static Analysis
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
RGSep action inference

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Memory leaks detection in java by bi-abductive inference

FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Automatic termination proofs for programs with shape-shifting heaps

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Implicit dynamic frames

ACM Transactions on Programming Languages and Systems (TOPLAS)
Heap-Dependent expressions in separation logic

FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Amortised resource analysis with separation logic

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
VeriSmall: verified smallfoot shape analysis

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
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
Crowfoot: a verifier for higher-order store programs

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Safe asynchronous multicore memory operations

ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Automated verification of shape, size and bag properties via user-defined predicates in separation logic

Science of Computer Programming
Efficient symbolic execution of value-based data structures for critical systems

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Towards a unified theory of operational and axiomatic semantics

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Diagnosing abstraction failure for separation logic-based analyses

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Invariant functions and invariant relations: An alternative to invariant assertions

Journal of Symbolic Computation
Formalised inductive reasoning in the logic of bunched implications

SAS'07 Proceedings of the 14th international conference on Static Analysis
Modular safety checking for fine-grained concurrency

SAS'07 Proceedings of the 14th international conference on Static Analysis
Arithmetic strengthening for shape analysis

SAS'07 Proceedings of the 14th international conference on Static Analysis
A theorem prover for Boolean BI

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Natural proofs for structure, data, and separation

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Thresher: precise refutations for heap reachability

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Local Reasoning for Global Invariants, Part I: Region Logic

Journal of the ACM (JACM)
Proof-Directed Parallelization Synthesis by Separation Logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automating separation logic using SMT

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Fissile type analysis: modular checking of almost everywhere invariants

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Proof search for propositional abstract separation logics via labelled sequents

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A proof system for separation logic with magic wand

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
An operational and axiomatic semantics for non-determinism and sequence points in C

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
VeriFast for java: a tutorial

Aliasing in Object-Oriented Programming
Software verification with VeriFast: Industrial case studies

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method uses a form of symbolic execution, a decidable proof theory for symbolic heaps, and extraction of frame axioms from incomplete proofs. This is a precursor to the use of the logic in automatic specification checking, program analysis, and model checking.