AIB 2007-02: SAT Solving for Termination Analysis with Polynomial Interpretations
- From: Peter Schneider-Kamp <peter@xxxxxxxxxxxxxxxxx>
- Date: Sun, 25 Feb 2007 18:04:12 -0500
The following technical report is available from
http://aib.informatik.rwth-aachen.de:
SAT Solving for Termination Analysis with Polynomial Interpretations
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp,
René Thiemann, and Harald Zankl
AIB 2007-02
Polynomial interpretations are one of the most popular techniques
for automated termination analysis. Therefore, 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.
.
- Prev by Date: AIB 2006-02: Parallel Algorithms for Verification of Large Systems
- Next by Date: AIB 2007-03: Proving Termination by Bounded Increase
- Previous by thread: AIB 2006-02: Parallel Algorithms for Verification of Large Systems
- Next by thread: AIB 2007-03: Proving Termination by Bounded Increase
- Index(es):