Termination of polynomial loops
From MaRDI portal
Publication:2233526
DOI10.1007/978-3-030-65474-0_5zbMath1474.68049OpenAlexW3118742020MaRDI QIDQ2233526
Jürgen Giesl, Marcel Hark, Florian Frohn
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-65474-0_5
Related Items (6)
A Calculus for Modular Loop Acceleration ⋮ Solving invariant generation for unsolvable loops ⋮ What else is undecidable about loops? ⋮ Unnamed Item ⋮ Synthesizing ranking functions for loop programs via SVM ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops
Cites Work
- Unnamed Item
- Unnamed Item
- Mixed-integer quadratic programming is in NP
- Fixed points, Nash equilibria, and the existential theory of the reals
- Termination of linear programs with nonlinear constraints
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- 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
- Symbolic termination analysis of solvable loops
- Polynomial invariants by linear algebra
- Geometric nontermination arguments
- Witness to non-termination of linear programs
- Generating all polynomial invariants in simple loops
- A recursive decision method for termination of linear programs
- Termination of Single-Path Polynomial Loop Programs
- Invariant Generation for Multi-Path Loops with Polynomial Assignments
- Complexity of Some Geometric and Topological Problems
- Automatic Generation of Polynomial Loop Invariants
- Termination of Semi-algebraic Loop Programs
- Synthesizing Invariants by Solving Solvable Loops
- What Can (and Can't) we Do with Sparse Polynomials?
- Ranking Templates for Linear Loops
- Computer Aided Verification
- On Termination of Integer Linear Loops
- Reasoning Algebraically About P-Solvable Loops
- Definability and decision problems in arithmetic
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Termination of polynomial loops
