DeepAI AI Chat
Log In Sign Up

On Termination of Integer Linear Loops

by   Mehran Hosseini, et al.

We consider the problem of determining termination of single-path loops with integer variables and affine updates. The problem asks 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. In this paper we show decidability of determining termination for arbitrary update matrices, but with a single inequality as the loop guard. Our decision procedure relies on number-theoretic results concerning Diophantine approximation. For the class of loops considered in this paper, the question of deciding termination on a specific initial value is a longstanding open problem.


page 1

page 2

page 3

page 4


Termination of Linear Loops over the Integers

We consider the problem of deciding termination of single-path while loo...

Termination of Triangular Integer Loops is Decidable

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

On the Decidability of Termination for Polynomial Loops

We consider the termination problem for triangular weakly non-linear loo...

Termination of linear loops under commutative updates

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

Determining r-Robustness of Arbitrary Digraphs Using Zero-One Linear Integer Programming

There has been an increase in the use of resilient control algorithms ba...

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...