Given the central role that C continues to play in systems software, and the difficulty of
writing safe and correct C code, it remains a grand challenge to develop effective formal …

Fine-grained concurrent programs are difficult to get right, yet play an important role in
modern-day computers. We want to prove strong specifications of such programs, with …

Recent years have seen great advances towards verifying large-scale systems code.
However, these verifications are usually based on hand-written assembly or machine-code …

We present a new flow framework for separation logic reasoning about programs that
manipulate general graphs. The framework overcomes problems in earlier developments: it …

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

Concurrent separation logic has been responsible for major advances in the formal
verification of fine-grained concurrent algorithms and data structures such as locks, barriers …

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 …

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 …

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 …