On the termination of integer loops

DOI10.1007/978-3-642-27940-9_6MaRDI QIDQ2891402zbMATH OpenOpenAlexFDO

Authors Samir Genaim, Abu Naser Masud, Amir M. Ben-Amram

Publication date 15 June 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-27940-9_6

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Termination of Integer Linear Programs
• On termination of integer linear loops
• Termination of linear programs with nonlinear constraints
• Termination of polynomial loops
• Computer Aided Verification

Cites work

• A new look at the automatic synthesis of linear ranking functions
• Computer Aided Verification
• CONCUR 2005 – Concurrency Theory
• Deciding stability and mortality of piecewise affine dynamical systems
• Hilbert's Tenth Problem: What was done and what is to be done
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 1302047 (Why is no real title available?)
• scientific article; zbMATH DE number 1405652 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Integer and mixed-integer programming models: General properties
• Monotonicity constraints for termination in the integer domain
• Recurrence with affine level mappings is P-time decidable for CLP
• Size-change termination, monotonicity constraints and ranking functions
• Termination of Integer Linear Programs
• The size-change principle for program termination
• Verification of gap-order constraint abstractions of counter systems
• Verification, Model Checking, and Abstract Interpretation

Cited in

(9)

• A type-based complexity analysis of object oriented programs
• Termination of polynomial loops
• Non-termination Sets of Simple Linear Loops
• On the edge of decidability in complexity analysis of loop programs
• Complexity of Restricted Variants of Skolem and Related Problems
• On Petri nets with hierarchical special arcs
• Ranking functions for linear-constraint loops
• CONCUR 2005 – Concurrency Theory
• Termination of triangular Integer loops is decidable

Describes a project that uses

Uses Software

• COSTA
• AProVE

This page was built for publication: On the termination of integer loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891402)