Termination of polynomial loops
From MaRDI portal
Recommendations
- Verification, Model Checking, and Abstract Interpretation
- Termination of single-path polynomial loop programs
- Termination of linear loops over the integers
- On termination of integer linear loops
- On the termination of integer loops
- Reflections on termination of linear loops
- Polynomial invariants for linear loops
- TERMINATION ANALYSIS OF LINEAR LOOPS
- A comparison of methods for terminating polynomial iterations
Cites work
- scientific article; zbMATH DE number 7559471 (Why is no real title available?)
- scientific article; zbMATH DE number 7561611 (Why is no real title available?)
- A recursive decision method for termination of linear programs
- Automatic Generation of Polynomial Loop Invariants
- Complexity of some geometric and topological problems
- Computer Aided Verification
- Definability and decision problems in arithmetic
- Fixed points, Nash equilibria, and the existential theory of the reals
- Generating all polynomial invariants in simple loops
- Geometric nontermination arguments
- Invariant generation for multi-path loops with polynomial assignments
- Mixed-integer quadratic programming is in NP
- On termination of integer linear loops
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Polynomial invariants by linear algebra
- Ranking Templates for Linear Loops
- Reasoning Algebraically About P-Solvable Loops
- Symbolic termination analysis of solvable loops
- Synthesizing invariants by solving solvable loops
- Termination of linear programs with nonlinear constraints
- Termination of semi-algebraic loop programs
- Termination of single-path polynomial loop programs
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- Verification, Model Checking, and Abstract Interpretation
- What can (and can't) we do with sparse polynomials?
- Witness to non-termination of linear programs
Cited in
(15)- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- A comparison of methods for terminating polynomial iterations
- Termination of single-path polynomial loop programs
- scientific article; zbMATH DE number 7471667 (Why is no real title available?)
- Invariant relations for affine loops
- A second-order formulation of non-termination
- A calculus for modular loop acceleration
- What else is undecidable about loops?
- On the termination of integer loops
- Termination analysis of nonlinear loops over closed and bounded connected domain
- Algorithms with polynomial interpretation termination proof
- Solving invariant generation for unsolvable loops
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
- Synthesizing ranking functions for loop programs via SVM
- Symbolic termination analysis of solvable loops
This page was built for publication: Termination of polynomial loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233526)
