SAT solving for termination analysis with polynomial interpretations
Fuhs, Carsten and Giesl, J. and Middeldorp, A. and Schneider-Kamp, P. and Thiemann, R. and Zankl, H. (2007) SAT solving for termination analysis with polynomial interpretations. In: Marques-Silva, J. and Sakallah, K.A. (eds.) Theory and Applications of Satisfiability Testing: SAT 2007, 10th International Conference. Lecture Notes in Computer Science 4501. Springer, pp. 340-354. ISBN 9783540727873.
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.
Metadata
Item Type: | Book Section |
---|---|
School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
Depositing User: | Carsten Fuhs |
Date Deposited: | 30 Mar 2021 10:15 |
Last Modified: | 09 Aug 2023 12:50 |
URI: | https://eprints.bbk.ac.uk/id/eprint/43736 |
Statistics
Additional statistics are available via IRStats2.