AI Chat AI Image Generator AI Video Text to Speech

Termination of Triangular Integer Loops is Decidable

05/21/2019

∙

by Florian Frohn, et al.

∙

∙

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.

Florian Frohn
10 publications
Jürgen Giesl
21 publications

page 1

page 2

page 3

page 4

research

∙ 02/20/2019

On Termination of Integer Linear Loops

We consider the problem of determining termination of single-path loops ...

0 Mehran Hosseini, et al. ∙

research

∙ 10/03/2019

Extensions of the Algorithmic Lovasz Local Lemma

We consider recent formulations of the algorithmic Lovasz Local Lemma by...

0 Vladimir Kolmogorov, et al. ∙

research

∙ 02/20/2019

Termination of Linear Loops over the Integers

We consider the problem of deciding termination of single-path while loo...

0 Mehran Hosseini, et al. ∙

research

∙ 05/28/2021

Reflections on Termination of Linear Loops

This paper shows how techniques for linear dynamical systems can be used...

0 Shaowei Zhu, et al. ∙

research

∙ 03/03/2020

Sparse Tiling through Overlap Closures for Termination of String Rewriting

We over-approximate reachability sets in string rewriting by languages d...

0 Alfons Geser, et al. ∙

research

∙ 12/01/2022

Locally Adaptive Hierarchical Cluster Termination With Application To Individual Tree Delineation

A clustering termination procedure which is locally adaptive (with respe...

0 Ashlin Richardson, et al. ∙

research

∙ 02/22/2021

Supermartingales, Ranking Functions and Probabilistic Lambda Calculus

We introduce a method for proving almost sure termination in the context...

0 Andrew Kenyon-Roberts, et al. ∙