Towards an Efficient Implementation of Tree Automata Completion - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Towards an Efficient Implementation of Tree Automata Completion

(1) , (1) , (2) , (1)
1
2
Emilie Balland
  • Function : Author
  • PersonId : 831082
Yohan Boichut
  • Function : Author
  • PersonId : 830638
Thomas Genet

Abstract

Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that a given term is reachable from a set of input terms, provides an efficient verification technique. Using a tree automata completion technique, it has been shown that the non reachability of a term t can be verified by computing an over- approximation of the set of reachable terms and proving that t is not in the over-approximation. Since the verification of real programs gives rise to rewrite models of significant size, efficient implementations of completion are essential. We present in this paper a TRS transformation preserving the reachability analysis by tree automata completion. This transforma- tion makes the completion implementation based on rewriting techniques possible. Thus, the reduction of a term to a state by a tree automaton is fully handled by rewriting. This approach has been prototyped in Tom, a language extension which adds rewriting primitives to Java. The first experiments are very promising relative to the state-of-the-art tool Timbuk.
Fichier principal
Vignette du fichier
finalversion.pdf (237.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00304010 , version 1 (24-09-2008)

Identifiers

  • HAL Id : inria-00304010 , version 1

Cite

Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau. Towards an Efficient Implementation of Tree Automata Completion. 12th International Conference on Algebraic Methodology and Software Technology - AMAST'08, Jul 2008, Urbana, Illinois, United States. pp.67-82. ⟨inria-00304010⟩
212 View
186 Download

Share

Gmail Facebook Twitter LinkedIn More