Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long and successful history in the development of tools for proving termination of programs. Well-known and very efficient techniques, like SAT algorithms and tools, have been recently proposed and used for implementing polynomial constraint solving algorithms through appropriate encodings. However, powerful techniques like the ones provided by the SMT (SAT modulo theories) approach for linear arithmetic constraints (over the rationals) are underexplored to date. In this paper we show that the use of these techniques for developing polynomial constraint solvers outperforms the best existing solvers and provides a new and powerful approach for implementing better and more general solvers for termination provers.
KeywordsConstraint solving polynomial constraints SAT modulo theories termination program analysis
Unable to display preview. Download preview PDF.
- 4.Contejean, E., Marché, C., Monate, B., Urbain, X.: Proving termination of rewriting with CiME. In: Proc. of 6th Int. Workshop on Termination (2003)Google Scholar
- 6.Dutertre, B., de Moura, L.: The Yices SMT solver. System description report, http://yices.csl.sri.com/
- 11.Fuhs, C., Navarro-Marset, R., Otto, C., Giesl, J., Lucas, S., Schneider-Kamp, P.: Search Techniques for Rational Polynomial Orders. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC 2008, Calculemus 2008, and MKM 2008. LNCS (LNAI), vol. 5144, pp. 109–124. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 19.Lucas, S.: Practical use of polynomials over the reals in proofs of termination. In: Proc. of 9th PPDP. ACM Press, New York (2007)Google Scholar