Skip to Main content Skip to Navigation
New interface
Reports (Research report)

A Note on the Precision of the Tree Automata Completion

Thomas Genet 1 
1 CELTIQUE - Software certification with semantic analysis
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : Tree Automata Completion is an algorithm over-approximating sets of terms reachable by rewriting. Precision of completion is conditioned by the, so-called, R/E-coherence property of the initial tree automaton. This paper shows that, in the particular case of functional TRS, this restriction can easily be removed. First, we prove that there always exists an equivalent R/E-coherent tree automaton. Second, we show how to approximate this equivalent tree automaton using completion itself and the Timbuk tool.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Thomas Genet Connect in order to contact the contributor
Submitted on : Friday, December 5, 2014 - 12:10:06 PM
Last modification on : Wednesday, October 26, 2022 - 8:15:37 AM
Long-term archiving on: : Monday, March 9, 2015 - 6:03:02 AM


Files produced by the author(s)


  • HAL Id : hal-01091393, version 1


Thomas Genet. A Note on the Precision of the Tree Automata Completion. [Research Report] IRISA. 2014, pp.13. ⟨hal-01091393⟩



Record views


Files downloads