English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Paper

Termination of Triangular Integer Loops is Decidable

MPS-Authors
/persons/resource/persons253052

Frohn,  Florian
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1905.08664.pdf
(Preprint), 319KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Frohn, F., & Giesl, J. (2019). Termination of Triangular Integer Loops is Decidable. Retrieved from https://arxiv.org/abs/1905.08664.


Cite as: https://hdl.handle.net/21.11116/0000-0007-CED1-5
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.