Termination of Triangular Integer Loops is Decidable
Logic in Computer Science
2019-05-22 v1
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.
Cite
@article{arxiv.1905.08664,
title = {Termination of Triangular Integer Loops is Decidable},
author = {Florian Frohn and Jürgen Giesl},
journal= {arXiv preprint arXiv:1905.08664},
year = {2019}
}
Comments
Full version (with proofs) of a paper published in the Proceedings of the 31st International Conference on Computer Aided Verification (CAV '19), New York, NY, USA, Lecture Notes in Computer Science, Springer-Verlag, 2019