We consider the satisfiability problem for a fragment of separation logic including inductive
predicates with shape and arithmetic properties. We show that the fragment is decidable if …

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 …

In this work, we consider the satisfiability problem in a logic that combines word equations
over string variables denoting words of unbounded lengths, regular languages to which …

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 …

Symbolic execution is a well established method for test input generation. Despite of having
achieved tremendous success over numerical domains, existing symbolic execution …

We introduce a novel decision procedure to the satisfiability problem in array separation
logic combined with general inductively defined predicates and arithmetic. Our proposal …

In this paper, we propose compositional separation logic with tree predicates (CSLTP),
where properties such as sortedness and height-balancedness of complex data structures …

Heap-manipulating programs are known to be challenging to reason about. We present a
novel verifier for heap-manipulating programs called S2TD, which encodes programs …

In separation logic, bi-abduction-a combination of abductive inference and frame inference-
is the key enabler for compositional reasoning, helping to scale up verification significantly …

Separation logic is a formalism for the verification of programs that make extensive use of
dynamic resources, such as heap-allocated memory. Separation logic enables modular …