A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

Automatic loop-invariant generation is important in program analysis and verification. In this
paper, we propose to generate loop-invariants automatically through learning and …

In this work, we present a novel approach based on recent advances in software model
checking to synthesize ranking functions and prove termination (and non-termination) of …

Abstract 2LS is a program analysis tool for C programs built upon the CPROVER
infrastructure. 2LS is bit-precise and it can verify and refute program assertions. 2LS …

Sequential emulation is a semantics-based technique to automatically reduce property
checking of distributed systems to the analysis of sequential programs. An automated …

Modern automated program repair (APR) is well-tuned to finding and repairing bugs that
introduce observable erroneous behavior to a program. However, a significant class of bugs …

Abstract Inspired by Rocco De Nicola and colleagues' novel approach to the compositional
analysis of complex adaptive systems, we foresee an integrated methodology combining …

While automated verification of imperative programs has been studied intensively, proving
termination of programs with explicit pointer arithmetic fully automatically was still an open …

We introduce a simple language for multi-agent systems that lends itself to intuitive design of
local specifications. Agents operate on (parts of) a decentralized data structure, the …

Termination is a crucial program property. Non-termination bugs can be subtle to detect and
may remain hidden for long before they take effect. Many real-world programs still suffer …