SAT Modulo Linear Arithmetic for Solving Polynomial Constraints

This publication has 30 references indexed in Scilit:

• Proving Termination Properties with mu-term
  2011
• Program analysis as constraint solving
  2008
• Constructing invariants for hybrid systems
  Formal Methods in System Design, 2007
• CVC3
  2007
• Termination of {aa→bc,bb→ac,cc→ab}
  Information Processing Letters, 2006
• Polynomials over the reals in proofs of termination : from theory to practice
  RAIRO - Theoretical Informatics and Applications, 2005
• Mechanically Proving Termination Using Polynomial Interpretations
  Journal of Automated Reasoning, 2005
• Non-linear loop invariant generation using Gröbner bases
  2004
• Semidefinite programming relaxations for semialgebraic problems
  Mathematical Programming, 2003
• A nullstellensatz and a positivstellensatz in semialgebraic geometry
  Mathematische Annalen, 1974