Skip to main content
Conference ProceedingsOPEN ACCESS

Termination of triangular integer loops is decidable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11562 LNCS 426-444
DOI: 10.1007/978-3-030-25543-5_24
8Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the problem whether termination of affine integer loops is decidable. Since Tiwari conjectured decidability in 2004 [15], only special cases have been solved [3, 4, 14]. We complement this work by proving decidability for the case that the update matrix is triangular.

Cite

CITATION STYLE

APA

Frohn, F., & Giesl, J. (2019). Termination of triangular integer loops is decidable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11562 LNCS, pp. 426–444). Springer Verlag. https://doi.org/10.1007/978-3-030-25543-5_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free