2026-07-23T13:58:32Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10694 2024-03-06T10:46:29Z ddc:004 open_access

Termination of Linear Loops over the Integers (Track B: Automata, Logic, Semantics, and Theory of Programming) Hosseini, Mehran Ouaknine, Joël Worrell, James Program Verification Loop Termination Linear Integer Programs Affine While Loops 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mehran Hosseini and Joël Ouaknine and James Worrell 2019 Is Part Of LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2019.118 urn:nbn:de:0030-drops-106940 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.118 eng https://creativecommons.org/licenses/by/3.0/legalcode