Contacto
Como comprar
Entrega
Guia de compras
An Efficient Finite Tree Automata Library
The Design of BDD-based Semi-symbolic Algorithms for Nondeterministic Finite Tree Automata
Inglês
112 b
Até 30 dias para devoluções
Os clientes também compraram
/
Capa mole
40.34
€
/
Calendário
80.78
€
/
Capa mole
55.91
€
/
Capa mole
78.15
€
Numerous computer systems use dynamic control and data structures of unbounded size that often have the character of trees or can be encoded as trees with some additional pointers. This is exploited by some currently intensively studied techniques of formal verification that represent an infinite number of states using a finite tree automaton. However, currently there is no tree automata library implementation that would provide an efficient and flexible support for such methods. Thus the aim of this Master's Thesis is to provide such a library. The present paper first describes the theoretical background of finite tree automata and regular tree languages. Then it surveys current tree automata libraries and studies various verification techniques, outlining requirements for the library. Representation of a finite tree automaton and algorithms that perform standard language operations on this representation are proposed in the next part, which is followed by description of library implementation. Through a series of experiments it is shown that the library can compete with other available tree automata libraries, in certain areas being significantly superior to them.
Sobre o livro
Inglês
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Capa mole
13.24
€
/
Capa mole
28.81
€
/
Livro de capa dura
21.73
€
/
Capa mole
54.69
€
/
Capa mole
13.94
€
Olá! Sou o Libroamiko, o seu conselheiro de livros.
Como posso ajudar?