Decidable Approximations of Sets of Descendants and Sets of Normal Forms - extended version - - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1997

Decidable Approximations of Sets of Descendants and Sets of Normal Forms - extended version -

Résumé

We present here decidable approximations of sets of descendants and sets of normal forms of Term Rewriting Systems, based on specific tree automata techniques. In the context of rewriting logic, a Term Rewriting System is a program, and a normal form is a result of the program. Thus, approximations of sets of descendants and sets of normal forms provide tools for analysing a few properties of programs: we show how to compute a superset of results, to prove the sufficient completeness property, or to find a criterion for proving termination under a specific strategy, the sequential reduction strategy.
Fichier principal
Vignette du fichier
RR-3325.pdf (367.8 Ko) Télécharger le fichier

Dates et versions

inria-00073364 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00073364 , version 1

Citer

Thomas Genet. Decidable Approximations of Sets of Descendants and Sets of Normal Forms - extended version -. [Research Report] RR-3325, INRIA. 1997, pp.28. ⟨inria-00073364⟩
88 Consultations
151 Téléchargements

Partager

Gmail Facebook X LinkedIn More