License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-24220
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2422/
Go to the corresponding Portal


Swiderski, Stephan ; Parting, Michael ; Giesl, Jürgen ; Fuhs, Carsten ; Schneider-Kamp, Peter

Inductive Theorem Proving meets Dependency Pairs

pdf-format:
Document 1.pdf (66 KB)


Abstract

Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is essentially due to an inductive argument. Therefore, we show how to couple the dependency pair method for TRS termination with inductive theorem proving. As confirmed by the implementation of our new approach in the tool AProVE, now TRS termination techniques are also successful on this important class of algorithms.

BibTeX - Entry

@InProceedings{swiderski_et_al:DSP:2010:2422,
  author =	{Stephan Swiderski and Michael Parting and J{\"u}rgen Giesl and Carsten Fuhs and Peter Schneider-Kamp},
  title =	{Inductive Theorem Proving meets Dependency Pairs},
  booktitle =	{Interaction versus Automation: The two Faces of Deduction},
  year =	{2010},
  editor =	{Thomas Ball and J{\"u}rgen Giesl and Reiner H{\"a}hnle and Tobias Nipkow},
  number =	{09411},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2422},
  annote =	{Keywords: Termination, Term Rewriting, Dependency Pairs, Inductive Theorem Proving}
}

Keywords: Termination, Term Rewriting, Dependency Pairs, Inductive Theorem Proving
Seminar: 09411 - Interaction versus Automation: The two Faces of Deduction
Issue Date: 2010
Date of publication: 09.03.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI