This paper describes a compositional shape analysis, where each procedure is analyzed
independently of its callers. The analysis uses an abstract domain based on a restricted …

The accurate and efficient treatment of mutable data structures is one of the outstanding
problem areas in automatic program verification and analysis. Shape analysis is a form of …

This article formalizes and compares two different styles of reasoning with inductively
defined predicates, each style being encapsulated by a corresponding sequent calculus …

We describe the design and implementation of an automated theorem prover realising a
fully general notion of cyclic proof. Our tool, called Cyclist, is able to construct proofs obeying …

Separation Logic is a widely used formalism for describing dynamically allocated linked data
structures, such as lists, trees, etc. The decidability status of various fragments of the logic …

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 …

Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex
recursive data structures, used in compositional verification of programs manipulating such …

The symbolic-heap fragment of separation logic has been actively developed and
advocated for verifying the memory-safety property of computer programs. At present, one of …

This paper presents a complete decision procedure for the entire quantifier-free fragment of
Separation Logic (SL) interpreted over heaplets with data elements ranging over a …

Most systems based on separation logic consider only restricted forms of implication or non-
separating conjunction, as full support for these connectives requires a non-trivial notion of …