Kontakt
Wie einkaufen
Versand
Kaufberater
An Efficient Finite Tree Automata Library
The Design of BDD-based Semi-symbolic Algorithms for Nondeterministic Finite Tree Automata
Englisch
112 b
Bis zu 30 Tage Rückgaberecht
Kunden kauften auch
/
Broschur
77.29
€
/
Broschur
37.29
€
/
Broschur
55.29
€
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.
Informationen zum Buch
Englisch
Kategorie
Verschenken Sie dieses Buch noch heute
Es ist ganz einfach
1 Legen Sie das Buch in Ihren Warenkorb und wählen Sie den Versand als Geschenk 2 Wir schicken Ihnen umgehend einen Gutschein 3 Das Buch wird an die Adresse des beschenkten Empfängers geliefertDas könnte Sie auch interessieren
/
Broschur
30.29
€
/
Broschur
56.29
€
/
Broschur
14.49
€
/
Broschur
50.99
€
Hallo! Ich bin Libroamiko, dein Buchberater.
Wie kann ich dir helfen?