Termination of Integer Linear Programs

DOI10.1007/11817963_34MaRDI QIDQ5756742zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Computer Aided Verification
• On termination of integer linear loops
• Termination of linear programs with nonlinear constraints
• Termination analysis of linear loop programs
• A recursive decision method for termination of linear programs

Cited in

(42)

• Automatic complexity analysis of integer programs via triangular weakly non-linear loops
• Algebraic model checking for discrete linear dynamical systems
• Computing expected runtimes for constant probability programs
• A complete and terminating approach to linear integer solving
• Discovering non-terminating inputs for multi-path polynomial programs
• A second-order formulation of non-termination
• Witness to non-termination of linear programs
• Closed-form upper bounds in static cost analysis
• A note on finite termination of iterative algorithms in mathematical programming
• A recursive decision method for termination of linear programs
• On the termination of integer loops
• Termination of single-path polynomial loop programs
• Recent advances in program verification through computer algebra
• Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
• Effective divergence analysis for linear recurrence sequences
• Tight polynomial bounds for loop programs in polynomial space
• scientific article; zbMATH DE number 7559471 (Why is no real title available?)
• Termination of linear loops over the integers
• Complexity of Restricted Variants of Skolem and Related Problems
• Computer Aided Verification
• On termination of integer linear loops
• Symbolic decision procedure for termination of linear programs
• Termination analysis of linear loop programs
• Ranking functions for linear-constraint loops
• Termination of linear programs with nonlinear constraints
• 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?
• Termination of triangular Integer loops is decidable
• Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
• Model checking linear dynamical systems under floating-point rounding
• On simulating Turing machines with matrix semigroups with integrality tests
• On robustness for the Skolem, positivity and ultimate positivity problems
• Linear dynamical systems with weight functions
• The 2-dimensional constraint loop problem is decidable
• Robust positivity problems for linear recurrence sequences: the frontiers of decidability for explicitly given neighbourhoods
• Termination of triangular polynomial loops
• Polynomial loops: beyond termination
• Targeting completeness: automated complexity analysis of integer programs
• Deciding termination of simple randomized loops
• Reflections on termination of linear loops

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

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