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

超越上下文无关的图形形状分析

Graph-Based Shape Analysis Beyond Context-Freeness

Hannah Arndt, Christina Jansen, Christoph Matheja, Thomas Noll

摘要:

我们开发了一个形状分析推理的关系属性的数据结构。具体域和抽象域都用超图表示。分析是由用户提供的索引图语法参数化,以指导具体化和抽象。这种上下文无关图文法的新扩展足够强大,可以对复杂的数据结构(如带有父指针的平衡二叉树)进行建模,同时保留上下文无关图文法的最理想属性。我们分析的一个优点是,除了语法之外,用户不需要任何工件;因此,它提供了高度的自动化。我们实现了我们的分析,并成功地将其应用到各种程序操纵AVL树,(双向链接)列表,以及两者的组合。

英文摘要:

We develop a shape analysis for reasoning about relational properties of data structures. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is parameterized by user-supplied indexed graph grammars to guide concretization and abstraction. This novel extension of context-free graph grammars is powerful enough to model complex data structures such as balanced binary trees with parent pointers, while preserving most desirable properties of context-free graph grammars. One strength of our analysis is that no artifacts apart from grammars are required from the user; it thus offers a high degree of automation. We implemented our analysis and successfully applied it to various programs manipulating AVL trees, (doubly-linked) lists, and combinations of both.

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

↑