Kontakt
Jak nakupovat
Doručení
Nákupní rádce
An Efficient Finite Tree Automata Library
The Design of BDD-based Semi-symbolic Algorithms for Nondeterministic Finite Tree Automata
Angličtina
100 b
Až 30 dní na vrácení zboží
Zákazníci také koupili
/
Brožovaná
813
Kč
/
Kalendář
1 760
Kč
/
Brožovaná
1 214
Kč
/
Brožovaná
1 681
Kč
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.
Informace o knize
Angličtina
Kategorie
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
654
Kč
/
Brožovaná
1 217
Kč
/
Brožovaná
320
Kč
Ahoj! Jsem Libroamiko, tvůj knižní rádce.
Jak ti můžu pomoct?