Skip to Main content Skip to Navigation
Reports

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
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01091393
Contributor : Thomas Genet <>
Submitted on : Friday, December 5, 2014 - 12:10:06 PM
Last modification on : Friday, July 10, 2020 - 4:21:18 PM
Long-term archiving on: : Monday, March 9, 2015 - 6:03:02 AM

File

Notes.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01091393, version 1

Citation

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

Share

Metrics

Record views

1087

Files downloads

99