Symbolic decision procedure for termination of linear programs

DOI10.1007/s00165-009-0144-5zbMath1216.68077OpenAlexW1971566420MaRDI QIDQ539162

Naijun Zhan, Zhi-Hai Zhang, Bican Xia, Lu Yang

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

zbMATH Keywords

symbolic computationnumerical computationterminationlinear programs

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

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 ⋮ Discovering non-terminating inputs for multi-path polynomial programs ⋮ Witness to non-termination of linear programs

Uses Software

• QEPCAD
• REDLOG
• DISCOVERER

Cites Work

• A complete discrimination system for polynomials
• Partial cylindrical algebraic decomposition for quantifier elimination
• 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
• Computer Aided Verification
• Unnamed Item

This page was built for publication: Symbolic decision procedure for termination of linear programs