Reachability Analysis over Term Rewriting Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Reachability Analysis over Term Rewriting Systems


This paper surveys some techniques and tools for achieving reachability analysis over term rewriting systems. The core of those techniques is a generic tree automata completion algorithm used to compute in an exact or approximated way the set of descendants (or reachable terms). This algorithm has been implemented in the Timbuk tool. Furthermore, we show that classes with regular sets of descendants of the literature corresponds to specific instances of the tree automata completion algorithm and can thus be efficiently computed by Timbuk. An extension of the completion algorithm to conditional term rewriting systems and some applications are also presented.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4970.pdf (435.78 Ko) Télécharger le fichier

Dates and versions

inria-00071609 , version 1 (23-05-2006)


  • HAL Id : inria-00071609 , version 1


Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. [Research Report] RR-4970, INRIA. 2003. ⟨inria-00071609⟩
139 View
331 Download


Gmail Facebook Twitter LinkedIn More