Abstract
Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most termination provers. We show that one can obtain speedups in orders of magnitude by encoding this task as a SAT problem and by applying modern SAT solvers. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., & Zankl, H. (2007). SAT solving for termination analysis with polynomial interpretations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4501 LNCS, pp. 340–354). Springer Verlag. https://doi.org/10.1007/978-3-540-72788-0_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
