Automated cyclic entailment proofs in separation logic

Authors:
James Brotherston;Dino Distefano;Rasmus Lerchedahl Petersen
Affiliations:
Dept. of Computing, Imperial College London;Dept. of Computer Science, Queen Mary University of London;Dept. of Computer Science, Queen Mary University of London
Venue:
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Year:
2011

Citing 16
Cited 1

Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Local Action and Abstract Separation Logic

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Cyclic proofs of program termination in separation logic

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational inductive shape analysis

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
jStar: towards practical verification for java

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Compositional shape analysis by means of bi-abduction

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
HOL Light: An Overview

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A Formalisation of Smallfoot in HOL

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
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
Undecidability of Propositional Separation Logic and Its Neighbours

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Sequent calculi for induction and infinite descent

Journal of Logic and Computation
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
Formalised inductive reasoning in the logic of bunched implications

SAS'07 Proceedings of the 14th international conference on Static Analysis
Shape analysis with structural invariant checkers

SAS'07 Proceedings of the 14th international conference on Static Analysis

Verified heap theorem prover by paramodulation

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general automated proof procedure, based upon cyclic proof, for inductive entailments in separation logic. Our procedure has been implemented via a deep embedding of cyclic proofs in the HOL Light theorem prover. Experiments show that our mechanism is able to prove a number of non-trivial entailments involving inductive predicates.