On Termination of Integer Linear Loops

@inproceedings{Ouaknine2015OnTO,
  title={On Termination of Integer Linear Loops},
  author={Jo{\"e}l Ouaknine and Jo{\~a}o Sousa Pinto and James Worrell},
  booktitle={SODA},
  year={2015}
}
A fundamental problem in program verification concerns the termination of simple linear loops of the form: x← u ; while Bx ≥ b do x← Ax+ a , where A and B are integer matrices, and u, a, and b are integer vectors. We give a decision procedure for the problem of whether such a loop terminates for all initial integer vectors u, provided that the matrix A is diagonalisable. The correctness of our algorithm relies on sophisticated tools from algebraic and analytic number theory, Diophantine… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 42 references

Termination of Integer Linear Programs

CAV • 2006
View 10 Excerpts
Highly Influenced

Linear relations on algebraic groups

D. W. Masser
New Advances in Transcendence Theory. Camb. Univ. Press, • 1988
View 4 Excerpts
Highly Influenced

Termination of Linear Programs

CAV • 2004
View 8 Excerpts
Highly Influenced

A note on recurring series

C. Lech
Ark. Mat., 2, • 1953
View 4 Excerpts
Highly Influenced

Eine arithmetische Eigenschaft der Taylor Koeffizienten rationaler Funktionen

K. Mahler
Proc. Akad. Wet. Amsterdam, 38, • 1935
View 4 Excerpts
Highly Influenced

Ein Verfahren zur Behandlung gewisser exponentialer Gleichungen

T. Skolem
Comptes rendus du congrès des mathématiciens scandinaves, • 1934
View 4 Excerpts
Highly Influenced