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 …

Termination is one of the basic liveness properties, and we study the termination problem for
probabilistic programs with real-valued variables. Previous works focused on the qualitative …

Distributed algorithms have many mission-critical applications ranging from embedded
systems and replicated databases to cloud computing. Due to asynchronous …

We show how the problem of nontermination proving can be reduced to a question of
underapproximation search guided by a safety prover. This reduction leads to new …

We show how Max-SMT-based invariant generation can be exploited for proving non-
termination of programs. The construction of the proof of non-termination is guided by the …

Techniques for proving termination and non-termination of imperative programs are usually
considered as orthogonal mechanisms. In this paper, we propose a novel mechanism that …

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 …

We present a new kind of nontermination argument, called geometric nontermination
argument. The geometric nontermination argument is a finite representation of an infinite …

We describe a novel technique for bounded analysis of asynchronous message-passing
programs with ordered message queues. Our bounding parameter does not limit the number …

When disproving termination using known techniques (eg recurrence sets), abstractions that
overapproximate the program's transition relation are unsound. In this paper we introduce …