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 …

In this article, we study the complexity of the problems: given a loop, described by linear
constraints over a finite set of variables, is there a linear or lexicographical-linear ranking …

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” …

We present a new parameterized abstract domain able to refine existing numerical abstract
domains with finite disjunctions. The elements of the abstract domain are decision trees …

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 …

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 …

We show how Max-SMT can be exploited in constraint-based program termination proving.
Thanks to expressing the generation of a ranking function as a Max-SMT optimization …

We present a constraint-based method for proving conditional termination of integer
programs. Building on this, we construct a framework to prove (unconditional) program …

Proving program termination is key to guaranteeing absence of undesirable behaviour, such
as hanging programs and even security vulnerabilities such as denial-of-service attacks. To …

Determining whether a given program terminates is the quintessential undecidable problem.
Algorithms for termination analysis may be classified into two groups:(1) algorithms with …