On the linear ranking problem for integer linear-constraint loops

DOI10.1145/2429069.2429078zbMath1301.68153OpenAlexW2039525895MaRDI QIDQ2931783

Samir Genaim, Amir M. Ben-Amram

Publication date: 27 November 2014

Published in: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2429069.2429078

zbMATH Keywords

linear constraintsterminationranking functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ Termination of Single-Path Polynomial Loop Programs ⋮ How to find the convex hull of all integer points in a polyhedron? ⋮ What's decidable about discrete linear dynamical systems? ⋮ Proving Termination Through Conditional Termination ⋮ Unnamed Item ⋮ Ranking Functions for Linear-Constraint Loops ⋮ Algebraic model checking for discrete linear dynamical systems

This page was built for publication: On the linear ranking problem for integer linear-constraint loops