Termination of linear programs with nonlinear constraints
DOI10.1016/J.JSC.2010.06.006zbMATH Open1208.68151OpenAlexW1976104755MaRDI QIDQ604395FDOQ604395
Authors: Bican Xia, Zhi-Hai Zhang 
Publication date: 10 November 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.06.006
Recommendations
cyclotomic polynomialterminationquantifier eliminationsemi-algebraic systemrationally independent group
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial cylindrical algebraic decomposition for quantifier elimination
- Title not available (Why is that?)
- The size-change principle for program termination
- Title not available (Why is that?)
- Computer Aided Verification
- Title not available (Why is that?)
- Deciding stability and mortality of piecewise affine dynamical systems
- Title not available (Why is that?)
- Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
- Symbolic decision procedure for termination of linear programs
- Verification, Model Checking, and Abstract Interpretation
- Termination of Integer Linear Programs
- Computing in the field of complex algebraic numbers
- Linear forms in the logarithms of algebraic numbers (IV)
Cited In (20)
- Termination of single-path polynomial loop programs
- Termination of semi-algebraic loop programs
- Discovering non-terminating inputs for multi-path polynomial programs
- Recurrence with affine level mappings is P-time decidable for CLP
- Signature-based method of deciding program~termination
- Witness to non-termination of linear programs
- On termination of integer linear loops
- A recursive decision method for termination of linear programs
- What else is undecidable about loops?
- On the termination of integer loops
- Termination of polynomial loops
- Title not available (Why is that?)
- Recent advances in program verification through computer algebra
- Termination analysis of linear loop programs
- Symbolic decision procedure for termination of linear programs
- Termination of Integer Linear Programs
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants
- Deciding conditional termination
- Computer Aided Verification
- Deciding conditional termination
Uses Software
This page was built for publication: Termination of linear programs with nonlinear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604395)
