scientific article; zbMATH DE number 7561611

DOI10.4230/LIPIcs.ICALP.2019.118MaRDI QIDQ5092319

Joël Ouaknine, Mehran Hosseini, James Worrell

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1902.07465

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

program verificationloop terminationlinear integer programsaffine while loops

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (11)

Reflections on termination of linear loops ⋮ Automatic discovery of fair paths in infinite-state transition systems ⋮ Termination of linear loops under commutative updates ⋮ What's decidable about discrete linear dynamical systems? ⋮ What else is undecidable about loops? ⋮ Unnamed Item ⋮ Termination of polynomial loops ⋮ Proving the existence of fair paths in infinite-state systems ⋮ Unnamed Item ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops ⋮ Algebraic model checking for discrete linear dynamical systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On iterating linear transformations over recognizable sets of integers
• On multiphase-linear ranking functions
• On the linear ranking problem for integer linear-constraint loops
• Computer Aided Verification
• Positivity Problems for Low-Order Linear Recurrence Sequences
• Abstract acceleration of general linear loops
• Ranking Functions for Linear-Constraint Loops
• Termination of Integer Linear Programs
• CONCUR 2005 – Concurrency Theory
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: