Solving non-linear polynomial arithmetic via SAT modulo linear arithmetic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5663 LNAI, Issue , 2009, Pages 294-305

  Borralleras, Cristina ^a   Lucas, Salvador ^b   Navarro Marset, Rafael ^b   Rodríguez Carbonell, Enric ^c   Rubio, Albert ^c  

^a UNIVERSITY OF VIC CENTRAL UNIVERSITY OF CATALONIA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Constraint solving; Polynomial constraints; Program analysis; SAT modulo theories; Termination

Indexed keywords

CONSTRAINT SOLVERS; CONSTRAINT SOLVING; ENCODINGS; LINEAR ARITHMETIC; LINEAR ARITHMETIC CONSTRAINTS; MODULO THEORIES; NON-LINEAR; PROGRAM ANALYSIS; SAT MODULO THEORIES; SOFTWARE VERIFICATION; TERMINATION;

AUTOMATION; VERIFICATION;

POLYNOMIALS;

EID: 69949176440     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02959-2_23     Document Type: Conference Paper

References (21)

1. Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236, 133-178 (2000)
2. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2003)
3. Bofill, M., Nieuwenhuis, R., Oliveras, A., Rodriǵuez-Carbonella, E., Rubio, A.: The Barcelogic SMT Solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 294-298. Springer, Heidelberg (2008)
4. Contejean, E., Marché, C., Monate, B., Urbain, X.: Proving termination of rewriting with CiME. In: Proc. of 6th Int. Workshop on Termination (2003)
5. Contejean, E., Marché, C., Tomás, A.-P., Urbain, X.: Mechanically proving termination using polynomial interpretations. Journal of Automated Reasoning 34(4), 325-363 (2006)
6. Dutertre, B., de Moura, L.: The Yices SMT solver. System description report, http://yices.csl.sri.com/
7. Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
8. Fränzle, M., Herde, C., Teige, T., Ratschan, S., Schubert, T.: Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure. Journal on Satisfiability, Boolean Modeling and Computation 1, 209-236 (2007)
9. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal termination. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 110-125. Springer, Heidelberg (2008)
10. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT Solving for Termination Analysis with Polynomial Interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 340-354. Springer, Heidelberg (2007)
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)
12. Giesl, J.: Generating Polynomial Orderings for Termination Proofs. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914. Springer, Heidelberg (1995)
13. Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS, vol. 4130, pp. 281-286. Springer, Heidelberg (2006)
14. Gulwani, S., Tiwari, A.: Constraint-Based Approach for Analysis of Hybrid Systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 190-203. Springer, Heidelberg (2008)
15. Hirokawa, N., Middeldorp, A.: Polynomial Interpretations with Negative Coefficients. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 185-198. Springer, Heidelberg (2004)
16. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. Information and Computation 205, 474-511 (2007)
17. Lucas, S.: MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 200-209. Springer, Heidelberg (2004), http://zenon.dsic.upv.es/muterm
18. Lucas, S.: Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications 39(3), 547-586 (2005)
19. Lucas, S.: Practical use of polynomials over the reals in proofs of termination. In: Proc. of 9th PPDP. ACM Press, New York (2007)
20. de Moura, L., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
21. Nguyen, M.T., De Schreye, D.: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 311-325. Springer, Heidelberg (2005)