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 …

The termination and complexity competition (termCOMP) focuses on automated termination
and complexity analysis for various kinds of programming paradigms, including categories …

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 consider the MSO model-checking problem for simple linear loops, or equivalently
discrete-time linear dynamical systems, with semialgebraic predicates (ie, Boolean …

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 …

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 …

We consider the problem of deciding termination of single-path while loops with integer
variables, affine updates, and affine guard conditions. The question is whether such a loop …

We present a novel modular approach to infer upper bounds on the expected runtimes of
probabilistic integer programs automatically. To this end, it computes bounds on the …

Motivated by applications to open program reasoning such as maximal specification
inference, this paper studies optimal CHC solving, a problem to compute maximal and/or …

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