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 …

The problem of automatically proving the equality of terms over recursive functions and
inductive data types is challenging, as such proofs often require auxiliary lemmas which …

We present a sequent-based deductive system for automatically proving entailments in
separation logic by using mathematical induction. Our technique, called mutual explicit …

We present a decision procedure for checking entailment between separation logic formulas
with inductive predicates specifying complex data structures corresponding to finite nesting …

Concurrent separation logics have helped to significantly simplify correctness proofs for
concurrent data structures. However, a recurring problem in such proofs is that data structure …

This paper shows that a variety of software model-checking algorithms can be seen as proof-
search strategies for a non-standard proof system, known as a cyclic proof system. Our use …

SL-COMP aims at bringing together researchers interested on improving the state of the art
of the automated deduction methods for Separation Logic (SL). The event took place twice …

Formal program verification can guarantee that a program is free from broad classes of
errors (like reads of uninitialized data and run-time errors) and that it complies with its …

Given separation logic formulae AA and CC, frame inference is the problem of checking
whether AA entails CC and simultaneously inferring residual heaps. Existing approaches on …