Loop Detection in Term Rewriting Using the Eliminating Unfoldings - Université de La Réunion Access content directly
Journal Articles Theoretical Computer Science Year : 2008

Loop Detection in Term Rewriting Using the Eliminating Unfoldings

Abstract

In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unication and an unfolding operation which processes both forwards and backwards and considers variable subterms. We also describe a technique to reduce the explosion of rules caused by the unfolding process. The idea is to eliminate from the set of unfoldings some rules that are estimated as useless for detecting loops. This is done by an approximation which consists in pruning the left-hand or right-hand side of the rules used to unfold. The analyser that we have implemented is able to solve most of the examples from the Termination Competition'07 that do not terminate due to a loop.
Fichier principal
Vignette du fichier
Loop_detection_in_term_rewriting_using_eliminating_unfoldings.pdf (325.28 Ko) Télécharger le fichier
Origin Explicit agreement for this submission
Loading...

Dates and versions

hal-01186183 , version 1 (08-11-2018)

Identifiers

  • HAL Id : hal-01186183 , version 1

Cite

Etienne Payet. Loop Detection in Term Rewriting Using the Eliminating Unfoldings. Theoretical Computer Science, 2008, 403 (2-3), pp.307-327. ⟨hal-01186183⟩
77 View
146 Download

Share

Gmail Mastodon Facebook X LinkedIn More