Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Under a Creative Commons license
open access
Keywords
Polynomial interpretations
term rewriting
program analysis
termination
Cited by (0)
- 1
This work has been partially supported by the EU (FEDER) and the Spanish MEC, under grants TIN 2004-7943-C04-02 and HA 2006-0007, and the Generalitat Valenciana under grant GV06/285. Rafael Navarro-Marset was partially supported by the Spanish MEC under FPU grant AP2006-026.
Copyright © 2008 Elsevier B.V.