On the linear ranking problem for integer linear-constraint loops
From MaRDI portal
Publication:2931783
DOI10.1145/2429069.2429078zbMath1301.68153MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Unnamed Item, Ranking Functions for Linear-Constraint Loops, Algebraic model checking for discrete linear dynamical systems, \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs, How to find the convex hull of all integer points in a polyhedron?, Termination of Single-Path Polynomial Loop Programs, Proving Termination Through Conditional Termination