Termination of linear loops over the integers
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 m...
Main Authors: | Hosseini, M, Ouaknine, J, Worrell, J |
---|---|
Format: | Conference item |
Published: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2019
|
Similar Items
-
O-minimal invariants for linear loops
by: Almagor, S, et al.
Published: (2018) -
What's decidable about linear loops?
by: Karimov, T, et al.
Published: (2022) -
On termination and divergence of linear programs
by: Hosseini, M
Published: (2021) -
Effective divergence analysis for linear recurrence sequences
by: Almagor, S, et al.
Published: (2018) -
Termination of linear loops under commutative updates
by: Dong, R
Published: (2023)