Symbolic decision procedure for termination of linear programs
From MaRDI portal
(Redirected from Publication:539162)
Recommendations
Cites work
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- A Low Complexity Interior-Point Algorithm for Linear Programming
- A complete discrimination system for polynomials
- An algorithm for isolating the real solutions of semi-algebraic systems
- Computer Aided Verification
- Partial cylindrical algebraic decomposition for quantifier elimination
- Recent advances on determining the number of real roots of parametric polynomials
Cited in
(9)- scientific article; zbMATH DE number 1953286 (Why is no real title available?)
- 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
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)