Symbolic decision procedure for termination of linear programs
DOI10.1007/S00165-009-0144-5zbMATH Open1216.68077OpenAlexW1971566420WikidataQ131119128 ScholiaQ131119128MaRDI QIDQ539162FDOQ539162
Authors: Bican Xia, Lu Yang, Naijun Zhan, Zhi-Hai Zhang 
Publication date: 27 May 2011
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-009-0144-5
Recommendations
Symbolic computation and algebraic computation (68W30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Partial cylindrical algebraic decomposition for quantifier elimination
- Title not available (Why is that?)
- Computer Aided Verification
- A complete discrimination system for polynomials
- Recent advances on determining the number of real roots of parametric polynomials
- An algorithm for isolating the real solutions of semi-algebraic systems
- A Low Complexity Interior-Point Algorithm for Linear Programming
Cited In (9)
- Title not available (Why is that?)
- Discovering non-terminating inputs for multi-path polynomial programs
- Signature-based method of deciding program~termination
- Witness to non-termination of linear programs
- A recursive decision method for termination of linear programs
- Recent advances in program verification through computer algebra
- Termination of linear programs with nonlinear constraints
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods
- Model checking linear dynamical systems under floating-point rounding
Uses Software
This page was built for publication: Symbolic decision procedure for termination of linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539162)
