We develop a doubly exponential decision procedure for the satisfiability problem of
guarded separation logic—a novel fragment of separation logic featuring user-supplied …

An efficient entailment proof system is essential to compositional verification using
separation logic. Unfortunately, existing decision procedures are either inexpressive or …

The list segment predicate ls ls used in separation logic for verifying programs with pointers
is well-suited to express properties on singly-linked lists. We study the effects of adding ls ls …

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 …

Wir studieren drei Aspekte der Programmverifikation mit Separation Logic (SL): 1. Die
Analyse quantitativer Eigenschaften, wie zB die Wahrscheinlichkeit der Terminierung ohne …

This article investigates the satisfiability problem for Separation Logic with k record fields,
with unrestricted nesting of separating conjunctions and implications. It focuses on prenex …

Foundational verification considers the functional correctness of programming languages
with formalized semantics and uses proof assistants (eg, Coq, Isabelle) to certify proofs. The …

We develop a doubly-exponential decision procedure for the satisfiability problem of
guarded separation logic--a novel fragment of separation logic featuring user-supplied …