Opening book details…
Can I read Equational Approximations for Tree Automata Completion on EtoBox?
Equational Approximations for Tree Automata Completion by Thomas Genet; Vlad Rusu is a Computer Science article available to read on EtoBox.
What is Equational Approximations for Tree Automata Completion about?
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term rewriting systems. An over-approximation of the set of reachable terms of a term rewriting system R is obtained by automatically constructing a finite tree automaton. The construction is parameterized by a set E of equations on terms, and we also show that the approximating automata recognize at most the set of R/E-reachable terms. Finally, we present some experiments carried out with the implementation of our algorithm. In particular, we show how some approximations from the literature can be defined using equational approximations.
Who reads Equational Approximations for Tree Automata Completion?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Thomas Genet; Vlad Rusu
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0747-7171)
- Published
- 2010
- Language
- EN
- Field
- Computer Science (Physical Sciences)