This tutorial provides an introduction to CPAchecker for users. CPAchecker is a flexible and
configurable framework for software verification and testing. The framework provides many …

In recent years they have been numerous works that aim to automate relational verification.
Meanwhile, although Constrained Horn Clauses (CHCs CHCs) empower a wide range of …

We present a novel approach to termination analysis. In a first step, the analysis uses a
program as a black-box which exhibits only a finite set of sample traces. Each sample trace …

We consider the fundamental problem of reachability analysis over imperative programs
with real variables. Previous works that tackle reachability are either unable to handle …

We present a modular approach to automatic complexity analysis of integer programs.
Based on a novel alternation between finding symbolic time bounds for program parts and …

CPAchecker is a versatile framework for software verification, rooted in the established
concept of configurable program analysis. Compared to the last published system …

Multiphase ranking functions (M\varPhi RFs) were proposed as a means to prove the
termination of a loop in which the computation progresses through a number of “phases” …

In 2014, Heizmann et al. proposed a novel framework for program termination analysis. The
analysis starts with a termination proof of a sample path. The path is generalized to a Büchi …

Multiphase ranking functions (M\varPhi RFs) are used to prove termination of loops in which
the computation progresses through a number of phases. They consist of linear functions …

Distributed protocols have long been formulated in terms of their safety and liveness
properties. Much recent work has focused on automatically verifying the safety properties of …