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 …

Separation logic is used as an assertion language for Hoare-style proof systems about
programs with pointers, and there is an ongoing quest for understanding its complexity and …

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

Separation Logic (SL) is a well-known assertion language used in Hoare-style modular
proof systems for programs with dynamically allocated data structures. In this paper we …

Like modal logic, temporal logic, and description logic, separation logic has become a
popular class of logical formalisms in computer science, conceived as assertion languages …

Most automated verifiers for separation logic are based on the symbolic-heap fragment,
which disallows both the magic-wand operator and the application of classical Boolean …

Separation logic is a well-known assertion language for Hoare-style proof systems. We
show that first-order separation logic with a unique record field restricted to two quantified …

This paper investigates the satisfiability problem for Separation Logic with k record fields,
with unrestricted nesting of separating conjunctions and implications, for prenex formulæ …

This paper considers Reynolds's separation logic with all logical connectives but without
arbitrary predicates. This logic is not recursively enumerable but is very useful in practice …

We study an extension of propositional separation logic that can specify robustness
properties, such as acyclicity and garbage freedom, for automatic verification of stateful …