We describe a new program termination analysis designed to handle imperative programs
whose termination depends on the mutation of the program's heap. We first describe how an …

Graphs may be used as representations of system states in operational semantics and
model checking; in the latter context, they are being investigated as an alternative to bit …

Previous shape analysis algorithms use a memory model where the heap is composed of
discrete nodes that can be accessed only via access paths built from variables and field …

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

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 …

Static analyses aim at inferring semantic properties of programs. While many analyses
compute an over-approximation of reachable states, some analyses compute a description …

We extend our approach for verifying properties of graph transformation systems using
suitable abstractions. In the original approach properties are specified as formulae of a …

Motivated by the verification of programs with pointer variables, we introduce a temporal
logic LTLmem whose underlying assertion language is the quantifier-free fragment of …

Formal verification of safety and liveness properties of systems with a dynamically changing,
unbounded number of interlinked processes and infinite-domain local data is challenging …

Spatial logics are used to reason locally about disjoint data structures. They consist of
standard first-order logic constructs, spatial (structural) connectives and their corresponding …