Copyright
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-12469
URL: http://drops.dagstuhl.de/opus/volltexte/2007/1246/
Thiemann, René ; Giesl, Jürgen ; Schneider-Kamp, Peter

Decision Procedures for Loop Detection

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

Abstract

The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitable for disproving termination: loops can be detected more easily. In a second step we analyze how to disprove innermost termination. Here, we present a novel procedure to decide whether a given loop is an innermost loop. All results have been implemented in the termination prover AProVE.

BibTeX - Entry

@InProceedings{thiemann_et_al:DSP:2007:1246,
  author =	{Ren{\'e} Thiemann and J{\"u}rgen Giesl and Peter Schneider-Kamp},
  title =	{Decision Procedures for Loop Detection},
  booktitle =	{Deduction and Decision Procedures},
  year =	{2007},
  editor =	{Franz Baader and Byron Cook and J{\"u}rgen Giesl and Robert Nieuwenhuis},
  number =	{07401},
  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/2007/1246},
  annote =	{Keywords: Non-Termination, Decision Procedures, Term Rewriting, Dependency Pairs}
}

Keywords: Non-Termination, Decision Procedures, Term Rewriting, Dependency Pairs
Seminar: 07401 - Deduction and Decision Procedures
Documenttype: InProceedings
Issue date: 2007
Date of publication: 29.11.2007

DROPS-Home | Fulltext Search | Imprint Published by LZI