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

瘦树上的量化数据自动机:列表的抽象域

Quantified Data Automata on Skinny Trees: an Abstract Domain for Lists

Pranav Garg, P. Madhusudan, Gennaro Parlato

摘要:

我们提出了一种新的方法,堆分析通过一个抽象的自动机域,称为自动形状。抽象域使用一种特殊类型的自动机,称为瘦树上的量化数据自动机(QSDA),它允许定义单链表的通用量化属性。为了确保抽象不动点计算的收敛性,我们引入了一个称为弹性QSDA的QSDA子类,它也形成了一个抽象域。我们评估我们的方法在几个列表操作程序,我们表明,所提出的域是强大的,足以证明这些程序的一大类是正确的。

英文摘要:

We propose a new approach to heap analysis through an abstract domain of automata, called automatic shapes. The abstract domain uses a particular kind of automata, called quantified data automata on skinny trees (QSDAs), that allows to define universally quantified properties of singly-linked lists. To ensure convergence of the abstract fixed-point computation, we introduce a sub-class of QSDAs called elastic QSDAs, which also form an abstract domain. We evaluate our approach on several list manipulating programs and we show that the proposed domain is powerful enough to prove a large class of these programs correct.

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

↑