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 the open-source tool T2, the first public release from the TERMINATOR project
[9]. T2 has been extended over the past decade to support automatic temporal-logic proving …

We present a new method for the constraint-based synthesis of termination arguments for
linear loop programs based on linear ranking templates. Linear ranking templates are …

We consider the problem of expected cost analysis over nondeterministic probabilistic
programs, which aims at automated methods for analyzing the resource-usage of such …

We study transformational program logics for correctness and incorrectness that we extend
to explicitly handle both termination and nontermination. We show that the logics are …

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 …

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 …

We study the problem of developing efficient approaches for proving worst-case bounds of
non-deterministic recursive programs. Ranking functions are sound and complete for …

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