arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1204.3240cs.FLcs.DS
收藏

一个高效的有限树自动机库

An Efficient Finite Tree Automata Library

Ondřej Lengál

摘要:

许多计算机系统使用动态控制和无限大小的数据结构。这些数据结构通常具有树的特征,或者它们可以被编码为带有一些附加指针的树。这是利用了一些目前深入研究的形式化验证技术,代表了无限数量的状态,使用有限树自动机。然而,目前还没有树自动机库实现,将提供一个有效的和灵活的支持,这样的方法。因此,本硕士论文的目的是提供这样一个图书馆。本文首先介绍了有限树自动机和正则树语言的理论背景。然后,它调查目前的实现树自动机库和研究各种验证技术,概述了库的要求。在下一部分中提出了有限树自动机的表示和在此表示上执行标准语言操作的算法,然后是库实现的描述。通过一系列的实验表明,该库可以与其他可用的树自动机库竞争,在某些领域甚至显着优于他们。

英文摘要:

Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they 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 the current implementations of 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 even significantly superior to them.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑