Termination of Integer Linear Programs

DOI10.1007/11817963_34zbMath1188.68183OpenAlexW1561261246MaRDI QIDQ5756742

Mark Braverman

Publication date: 5 September 2007

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11817963_34

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (24)

On the Termination of Integer Loops ⋮ Reflections on termination of linear loops ⋮ Termination of Single-Path Polynomial Loop Programs ⋮ Recent advances in program verification through computer algebra ⋮ Termination of linear programs with nonlinear constraints ⋮ Generating exact nonlinear ranking functions by symbolic-numeric hybrid method ⋮ Termination of linear loops under commutative updates ⋮ What's decidable about discrete linear dynamical systems? ⋮ Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials ⋮ What else is undecidable about loops? ⋮ Closed-form upper bounds in static cost analysis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computing expected runtimes for constant probability programs ⋮ Complexity of Restricted Variants of Skolem and Related Problems ⋮ Ranking Functions for Linear-Constraint Loops ⋮ O-Minimal Invariants for Discrete-Time Dynamical Systems ⋮ Discovering non-terminating inputs for multi-path polynomial programs ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops ⋮ Algebraic model checking for discrete linear dynamical systems ⋮ A second-order formulation of non-termination ⋮ Witness to non-termination of linear programs

This page was built for publication: Termination of Integer Linear Programs