Reachability Analysis of Term Rewriting Systems with Timbuk - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2001

Reachability Analysis of Term Rewriting Systems with Timbuk

Thomas Genet

Résumé

We present Timbuk - a tree automata library - which implements usual operation- s on tree automata as well as a completion algorithm used to compute an over-approximation of the set of descendants R*(E) for a regular set E and a term rewriting system R, possibly non linear and non terminating. On several examples of term rewriting systems representing programs and systems to verify, we show how to use Timbuk to construct their approximations and then prove unreachability properties of these systems.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4266.pdf (300.44 Ko) Télécharger le fichier

Dates et versions

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

Identifiants

  • HAL Id : inria-00072321 , version 1

Citer

Thomas Genet, Valérie Viet Triem Tong. Reachability Analysis of Term Rewriting Systems with Timbuk. [Research Report] RR-4266, INRIA. 2001. ⟨inria-00072321⟩
91 Consultations
371 Téléchargements

Partager

Gmail Facebook X LinkedIn More