Ond ej Lengál

An Efficient Finite Tree Automata Library

The Design of BDD-based Semi-symbolic Algorithms for Nondeterministic Finite Tree Automata

• Broschiertes Buch

Produktbeschreibung

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 libraryimplementation. 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.

Produktdetails

• Verlag: LAP Lambert Academic Publishing
• Seitenzahl: 64
• Erscheinungstermin: 9. Oktober 2012
• Englisch
• Abmessung: 220mm x 150mm x 4mm
• Gewicht: 113g
• ISBN-13: 9783659270697
• ISBN-10: 3659270695
• Artikelnr.: 36642275

Autorenporträt

Ond¿ej Lengál received his Master's degree at Faculty of Information Technology, Brno University of Technology. He is interested in theoretical computer science and verification of complex programs and computer systems, and is currently pursuing a Ph.D. degree in these areas.