Despite significant progress in the verification of hypervisors, operating systems, and
compilers, and in verification tooling, there exists a wide gap between the approaches used …

This paper presents matching logic, a first-order logic (FOL) variant for specifying and
reasoning about structure by means of patterns and pattern matching. Its sentences, the …

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 …

We describe a formal verification framework and tool implementation, based upon cyclic
proofs, for certifying the safe termination of imperative pointer programs with recursive …

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

We introduce a new dynamic analysis technique to discover invariants in separation logic for
heap-manipulating programs. First, we use a debugger to obtain rich program execution …

We investigate array separation logic (ASL), a variant of symbolic-heap separation logic in
which the data structures are either pointers or arrays, ie, contiguous blocks of memory. This …

Separation logic has become an important tool for formally capturing and reasoning about
the ownership patterns of imperative programs, originally for paper proof, and now the …

Bounded verification has proved useful to detect bugs and to increase confidence in the
correctness of a program. In contrast to unbounded verification, reasoning about calls via …

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