Summary: SAT Solving for Termination Analysis with
Polynomial Interpretations ###
Carsten Fuhs 1 , J˜urgen Giesl 1 , Aart Middeldorp 2 , Peter Schneider­Kamp 1 ,
Ren’e Thiemann 1 , and Harald Zankl 2
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.
1 Introduction
Termination is one of the most important properties of programs and therefore,
there is a need for techniques and tools that analyze the termination behavior
of programs automatically. In particular, there has been intensive research on
methods for termination analysis of term rewrite systems (TRSs) [4]. Instead
of developing several separate termination techniques for di#erent programming
languages, a promising approach is to transform programs from di#erent lan­

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

Collections: Computer Technologies and Information Sciences