• Corpus ID: 239019993

Termination of Triangular Polynomial Loops

  title={Termination of Triangular Polynomial Loops},
  author={Marcel Hark and Florian Frohn and J{\"u}rgen Giesl},
We consider the problem of proving termination for triangular weakly non-linear loops ( twn -loops) over some ring S like Z , Q , or R . The guard of such a loop is an arbitrary quantifier-free Boolean formula over (pos-sibly non-linear) polynomial inequations, and the body is a single assignment of the form x + p d i where each x i is a variable, c i ∈ S , and each p i is a (possibly non-linear) polynomial over S and the variables x i +1 , . . . , x d . We show that the question of termination… 

Figures from this paper


Termination of Polynomial Loops
A reduction from the question of termination to the existential fragment of the first-order theory of S and R is presented, which proves semi-decidability of non-termination and tight complexity bounds for the termination problem for two important classes of loops which can always be transformed into twn-loops.
Polynomial Loops: Beyond Termination
The halting problem is decidable for twn-loops over any ring Z ≤ S ≤ RA and the first computability results on the runtime complexity of such loops are presented, showing that the runtime of a terminating triangular linear loop over Z is at most linear.
On the Termination of Integer Loops
It is shown that termination of simple integer loops is undecidable in some cases, in particular, when the body of the loop is expressed by a set of linear inequalities where the coefficients are from Z ∪ {r} with r an arbitrary irrational.
Witness to non-termination of linear programs
  • Yi Li
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2017
Termination of Linear Loops over the Integers
The key to the decision procedure is in showing how to circumvent the difficulties inherent in deciding termination on a fixed initial value, which confirms Tiwari's conjecture.
Symbolic termination analysis of solvable loops
Deciding Conditional Termination
The problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates, is addressed, and it is shown that, for programs with no nested control loops, and whose loops are labeled with octagonal constraints, the dual problem is NP-complete.
Termination of linear programs with nonlinear constraints
On Termination of Integer Linear Loops
This work gives a decision procedure for the termination of simple linear loops of the form:[EQUATION] where x is a vector of variables, u, a, and c are integer vectors, and A and B are integer matrices.
Termination of Integer Linear Programs
It is shown that termination of deterministic linear loops is decidable over the integers in the homogeneous case, and over the rationals in the general case, by analyzing the powers of a matrix symbolically using its eigenvalues.