Termination of Triangular Integer Loops is Decidable

05/21/2019
by   Florian Frohn, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset