Termination of Triangular Integer Loops is Decidable
classification
💻 cs.LO
keywords
decidabilitydecidableintegerloopsterminationtriangularaffinebeen
read the original abstract
We consider the problem whether termination of affine integer loops is decidable. Since Tiwari conjectured decidability in 2004, only special cases have been solved. We complement this work by proving decidability for the case that the update matrix is triangular.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.