January 01, 2020 conference-paper Aachen paper

Termination of Polynomial Loops

Lecture notes in computer science, pp. 89–112

DOI: 10.1007/978-3-030-65474-0_5 OpenAlex

Authors 3

Florian Frohn

Max Planck Institute for Informatics

Affiliation as printed

Max Planck Institute for Informatics and Saarland Informatics Campus, Saarbrücken, Germany
Marcel Hark corresponding Aachen LuFG Informatik 2

RWTH Aachen University

Affiliation as printed

LuFG Informatik 2, RWTH Aachen University, Aachen, Germany
Jürgen Giesl Aachen LuFG Informatik 2

RWTH Aachen University

Affiliation as printed

LuFG Informatik 2, RWTH Aachen University, Aachen, Germany

Cited by 12 stored of 12

Preface of the special issue on the static analysis symposium 2020 and 2022
2025 Formal Methods in System Design editorial Materials Science High-Velocity Impact and Material Behavior Open access

0

citations
A Machine Learning-Based Approach for Solving Recurrence Relations and Its use in Cost Analysis of Logic Programs
2024 Theory and Practice of Logic Programming article Computer Science Formal Methods in Verification Open access

5

citations
(Un)Solvable loop analysis
2024 Formal Methods in System Design article Computer Science Formal Methods in Verification Open access

8

citations
Invariant relations for affine loops
2024 Acta Informatica article Computer Science Logic, programming, and type systems Open access

1

citations
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis
2024 Proceedings of the ACM on Programming Languages article Computer Science Formal Methods in Verification Open access

11

citations
Termination of triangular polynomial loops
2023 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access

8

citations
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

7

citations
A calculus for modular loop acceleration and non-termination proofs
2022 International Journal on Software Tools for Technology Transfer article Computer Science Logic, programming, and type systems Open access

8

citations
Solving Invariant Generation for Unsolvable Loops
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

21

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

7

citations
A Calculus for Modular Loop Acceleration
2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

24

citations
On the Decidability of Termination for Polynomial Loops
2019 MPG.PuRe (Max Planck Society) report Computer Science Polynomial and algebraic computation Open access

3

citations

12 results

No patents citing this paper on Lens.org (checked 2026-10-06).

References 70

A Decision Method for Elementary Algebra and Geometry
1998 Texts & monographs in symbolic computation/Texts and monographs in symbolic computation book-chapter Decision Sciences Scheduling and Timetabling Solutions Open access

1,682

citations
Algorithms in Real Algebraic Geometry
2003 Algorithms and computation in mathematics book Computer Science Polynomial and algebraic computation

1,167

citations
Algorithms in Real Algebraic Geometry
2006 Algorithms and computation in mathematics book Computer Science Computational Geometry and Mesh Generation

864

citations
On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
1992 Journal of Symbolic Computation article Computer Science Polynomial and algebraic computation Open access

620

citations
Polynomial Automorphisms and the Jacobian Conjecture
2021 Frontiers in mathematics book Mathematics Algebraic Geometry and Number Theory

593

citations
A Complete Method for the Synthesis of Linear Ranking Functions
2004 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

422

citations
Definability and decision problems in arithmetic
1949 Journal of Symbolic Logic article Computer Science Computability, Logic, AI Algorithms

325

citations
Polynomial Automorphisms
2000 Birkhäuser Basel eBooks book Mathematics Algebraic Geometry and Number Theory

275

citations
Decision procedures for real and p‐adic fields
1969 Communications on Pure and Applied Mathematics article Mathematics Advanced Topology and Set Theory

214

citations
Termination of Linear Programs
2004 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

168

citations
Proving non-termination
2008 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) conference-paper Computer Science Formal Methods in Verification Open access

158

citations
Complexity of Some Geometric and Topological Problems
2010 Lecture notes in computer science conference-paper Computer Science Advanced Graph Theory Research

147

citations
Analyzing Program Termination and Complexity Automatically with AProVE
2016 Journal of Automated Reasoning article Computer Science Logic, programming, and type systems Open access

132

citations
Generating all polynomial invariants in simple loops
2007 Journal of Symbolic Computation article Computer Science Logic, programming, and type systems Open access

131

citations
Termination of Polynomial Programs
2005 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

124

citations
Termination of Integer Linear Programs
2006 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

123

citations
Mixed-integer quadratic programming is in NP
2016 Mathematical Programming article Mathematics Advanced Optimization Algorithms Research

114

citations
Automatic Generation of Polynomial Loop Invariants
2004 International Symposium on Symbolic and Algebraic Computation conference-paper Computer Science Logic, programming, and type systems

111

citations
Nearly Optimal Algorithms for Canonical Matrix Forms
1995 SIAM Journal on Computing article Computer Science Polynomial and algebraic computation

100

citations
The Concrete Tetrahedron
2011 Texts & monographs in symbolic computation/Texts and monographs in symbolic computation book Mathematics History and Theory of Mathematics

98

citations