Contact
How to shop
Delivery
Shopping guide
An Efficient Finite Tree Automata Library
The Design of BDD-based Semi-symbolic Algorithms for Nondeterministic Finite Tree Automata
English
421 b
Delivery to Austria
Up to 30 days for returns
Customers also purchased
/
Paperback
54.99
€
/
Paperback
35.29
€
/
Paperback
72.89
€
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
11.69
€
/
Paperback
26.69
€
/
Paperback
43.89
€
/
Paperback
13.09
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?