License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-5091
URL: http://drops.dagstuhl.de/opus/volltexte/2006/509/

Giesl, Jürgen ; Thiemann, René ; Schneider-Kamp, Peter

Proving and Disproving Termination in the Dependency Pair Framework

pdf-format:
Dokument 1.pdf (69 KB)


Abstract

The dependency pair framework is a new general concept to integrate arbitrary techniques for termination analysis of term rewriting. In this way, the benefits of different techniques can be combined and their modularity and power are increased significantly. Moreover, this framework facilitates the development of new methods for termination analysis. Traditionally, the research on termination focused on methods which prove termination and there were hardly any approaches for disproving termination. We show that with the dependency pair framework, one can combine the search for a proof and for a disproof of termination. In this way, we obtain the first powerful method which can also verify non-termination of term rewrite systems. We implemented and evaluated our contributions in the automated termination prover AProVE. Due to these results, AProVE was the winning tool in the International Competition of Termination Provers 2005, both for proving and for disproving termination of term rewriting.

BibTeX - Entry

@InProceedings{giesl_et_al:DSP:2006:509,
  author =	{J{\"u}rgen Giesl and Ren{\'e} Thiemann and Peter Schneider-Kamp},
  title =	{Proving and Disproving Termination in the Dependency Pair Framework},
  booktitle =	{Deduction and Applications},
  year =	{2006},
  editor =	{Franz Baader and Peter Baumgartner and Robert Nieuwenhuis and Andrei Voronkov},
  number =	{05431},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/509},
  annote =	{Keywords: Termination, non-termination, term rewriting, dependency pairs}
}

Keywords: Termination, non-termination, term rewriting, dependency pairs
Seminar: 05431 - Deduction and Applications
Issue date: 2006
Date of publication: 25.04.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI