On the Termination of Integer Loops

DOI10.1007/978-3-642-27940-9_6zbMath1325.68056OpenAlexW3148387491MaRDI QIDQ2891402

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

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) 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 (4)

A type-based complexity analysis of object oriented programs ⋮ On Petri Nets with Hierarchical Special Arcs ⋮ Complexity of Restricted Variants of Skolem and Related Problems ⋮ Ranking Functions for Linear-Constraint Loops

Uses Software

• COSTA
• AProVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new look at the automatic synthesis of linear ranking functions
• Integer and mixed-integer programming models: General properties
• Verification of Gap-Order Constraint Abstractions of Counter Systems
• Monotonicity Constraints for Termination in the Integer Domain
• The size-change principle for program termination
• Computer Aided Verification
• Recurrence with affine level mappings is P-time decidable for CLP
• Termination of Integer Linear Programs
• CONCUR 2005 – Concurrency Theory
• Size-Change Termination, Monotonicity Constraints and Ranking Functions
• Verification, Model Checking, and Abstract Interpretation
• Deciding stability and mortality of piecewise affine dynamical systems

This page was built for publication: On the Termination of Integer Loops