| | |
Summary: SAT Solving for Termination Analysis with
Polynomial Interpretations
Carsten Fuhs1
, J¨urgen Giesl1
, Aart Middeldorp2
, Peter Schneider-Kamp1
,
Ren´e Thiemann1
, and Harald Zankl2
1
LuFG Informatik 2, RWTH Aachen, Germany,
{fuhs,giesl,psk,thiemann}@informatik.rwth-aachen.de
2
Institute of Computer Science, University of Innsbruck, Austria,
{aart.middeldorp,harald.zankl}@uibk.ac.at
Abstract. Polynomial interpretations are one of the most popular tech-
niques for automated termination analysis and the search for such inter-
pretations 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.
|
