SAT solving for termination analysis with polynomial interpretations

Carsten Fuhs*, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl

*Kontaktforfatter for dette arbejde

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

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.

OriginalsprogEngelsk
TitelTheory and Applications of Satisfiability Testing - SAT 2007 - 10th International Conference, Proceedings
Antal sider15
Publikationsdato1. dec. 2007
Sider340-354
ISBN (Trykt)9783540727873
StatusUdgivet - 1. dec. 2007
Begivenhed10th International Conference on Theory and Applications of Satisfiability Testing, SAT 2007 - Lisbon, Portugal
Varighed: 28. maj 200731. maj 2007

Konference

Konference10th International Conference on Theory and Applications of Satisfiability Testing, SAT 2007
LandPortugal
ByLisbon
Periode28/05/200731/05/2007
NavnLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vol/bind4501 LNCS
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'SAT solving for termination analysis with polynomial interpretations'. Sammen danner de et unikt fingeraftryk.

Citationsformater