Proving Termination using Recursive Path Orders and SAT solving

DMCA

Proving Termination using Recursive Path Orders and SAT solving (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Peter Schneider-Kamp , René Thiemann , Elena Annov , Michael Codish , Jürgen Giesl

Venue:	IN PROC. FROCOS ’07, LNAI 4720
Citations:	17 - 8 self

BibTeX

@INPROCEEDINGS{Schneider-Kamp07provingtermination,
    author = {Peter Schneider-Kamp and René Thiemann and Elena Annov and Michael Codish and Jürgen Giesl},
    title = {Proving Termination using Recursive Path Orders and SAT solving},
    booktitle = {IN PROC. FROCOS ’07, LNAI 4720},
    year = {2007},
    pages = {267--282},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers permutations of the arguments in the lexicographic comparison. Our encoding allows us to apply SAT solvers in order to determine whether a given term rewrite system is RPO-terminating. Furthermore, to apply RPO within the dependency pair framework, we combined our novel encoding for RPO with an existing encoding for argument filters. We implemented our contributions in the termination prover AProVE. Our experiments show that due to our encoding, combining termination provers with SAT solvers improves the performance of RPO-implementations by orders of magnitude.

Keyphrases

recursive path order sat solver term rewrite system lexicographic comparison argument filter propositional encoding termination provers novel encoding multiset path order lexicographic path order dependency pair framework termination prover aprove

DMCA