Guided Unfoldings for Finding Loops in Standard Term Rewriting - Université de La Réunion Access content directly
Preprints, Working Papers, ... Year : 2018

Guided Unfoldings for Finding Loops in Standard Term Rewriting

Abstract

In this paper, we reconsider the unfolding-based technique that we have introduced previously for detecting loops in standard term rewriting. We improve it by guiding the unfolding process, using distinguished positions in the rewrite rules. This results in a depth-first computation of the unfoldings, whereas the original technique was breadth-first. We have implemented this new approach in our tool NTI and compared it to the previous one on a bunch of rewrite systems. The results we get are promising (better times, more successful proofs).
Fichier principal
Vignette du fichier
1808.05065.pdf (189.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01912030 , version 1 (05-11-2018)

Identifiers

Cite

Etienne Payet. Guided Unfoldings for Finding Loops in Standard Term Rewriting. 2018. ⟨hal-01912030⟩
44 View
115 Download

Altmetric

Share

Gmail Facebook X LinkedIn More