DeepAI AI Chat
Log In Sign Up

Termination of Linear Loops over the Integers

by   Mehran Hosseini, et al.

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 terminates on all integer initial values. This problem is known to be decidable for the subclass of loops whose update matrices are diagonalisable, but the general case has remained open since being conjectured decidable by Tiwari in 2004. In this paper we show decidability of determining termination for arbitrary update matrices, confirming Tiwari's conjecture. For the class of loops considered in this paper, the question of deciding termination on a specific initial value is a longstanding open problem in number theory. The key to our decision procedure is in showing how to circumvent the difficulties inherent in deciding termination on a fixed initial value.


On Termination of Integer Linear Loops

We consider the problem of determining termination of single-path loops ...

Termination of linear loops under commutative updates

We consider the following problem: given d × d rational matrices A_1, …,...

Termination of Triangular Integer Loops is Decidable

We consider the problem whether termination of affine integer loops is d...

This is not the End: Rethinking Serverless Function Termination

Elastic scaling is one of the central benefits provided by serverless pl...

All-Instances Restricted Chase Termination: The Guarded Case

The chase procedure is a fundamental algorithmic tool in database theory...

Reflections on Termination of Linear Loops

This paper shows how techniques for linear dynamical systems can be used...

Extensions of the Algorithmic Lovasz Local Lemma

We consider recent formulations of the algorithmic Lovasz Local Lemma by...