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

集共享性、自由性和线性性的正确、精确和有效的结合用于有限和有理树语言的分析

A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages

Patricia M. Hill, Enea Zaffanella, Roberto Bagnara

摘要:

众所周知,自由度和线性信息与混叠信息积极地相互作用,从而允许提高逻辑程序的共享分析的精度和效率。本文提出了一种新的集合共享与自由度和线性信息的组合,其特征在于一个改进的抽象统一算子。我们提供了一个新的抽象函数,并证明了有限树和有理树的情况下的分析的正确性。此外,我们表明,相同的冗余信息的概念(Bagnara等。2002年; Zaffanella等。2002年)也适用于这个抽象域的组合:这允许实现一个抽象的统一运营商运行在多项式时间,并实现相同的精度对所有考虑的可观察的属性。

英文摘要:

It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of logic programs to be improved. In this paper we present a novel combination of set-sharing with freeness and linearity information, which is characterized by an improved abstract unification operator. We provide a new abstraction function and prove the correctness of the analysis for both the finite tree and the rational tree cases. Moreover, we show that the same notion of redundant information as identified in (Bagnara et al. 2002; Zaffanella et al. 2002) also applies to this abstract domain combination: this allows for the implementation of an abstract unification operator running in polynomial time and achieving the same precision on all the considered observable properties.

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

↑