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

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 …

A fundamental problem in program verification concerns the termination of simple linear
loops of the form: where x is a vector of variables, u, a, and c are integer vectors, and A and …

What’s Decidable About Discrete Linear Dynamical Systems? | SpringerLink Skip to main
content Advertisement Springer Nature Link Account Menu Find a journal Publish with us …

We present a novel technique for proving program termination which introduces a new
dimension of modularity. Existing techniques use the program to incrementally construct a …

Program termination is a hot research topic in program analysis. The last few years have
witnessed the development of termination analyzers for programming languages such as C …

Proving program termination is typically done by finding a well-founded ranking function for
the program states. Existing termination provers typically find ranking functions using either …