论共享与线性的相互作用
On the interaction between sharing and linearity
摘要：
在逻辑程序的分析中，用于检测共享和线性信息的抽象域被广泛使用。设计这样的域的抽象统一算法已被证明是相当困难的。目前，可用的算法是正确的，但不是最佳的，即，它们不能充分利用由抽象域传达的信息。在本文中，我们定义了一个新的（无限）域ShLin-w，它可以被认为是一个一般的框架，其他域可以很容易地通过抽象得到。ShLin-w使共享和线性之间的相互作用变得明确。我们提供了一个建设性的表征的最佳抽象统一运营商的ShLin-w，我们提升到两个著名的抽象ShLin-w。即，经典的Sharing X Lin抽象域和Andy King的更精确的ShLin-2抽象域。在单绑定取代的情况下，我们得到最佳的抽象统一算法，这样的域。出现在逻辑编程理论与实践（TPLP）中。
英文摘要：
In the analysis of logic programs, abstract domains for detecting sharing and linearity information are widely used. Devising abstract unification algorithms for such domains has proved to be rather hard. At the moment, the available algorithms are correct but not optimal, i.e., they cannot fully exploit the information conveyed by the abstract domains. In this paper, we define a new (infinite) domain ShLin-w which can be thought of as a general framework from which other domains can be easily derived by abstraction. ShLin-w makes the interaction between sharing and linearity explicit. We provide a constructive characterization of the optimal abstract unification operator on ShLin-w and we lift it to two well-known abstractions of ShLin-w. Namely, to the classical Sharing X Lin abstract domain and to the more precise ShLin-2 abstract domain by Andy King. In the case of single binding substitutions, we obtain optimal abstract unification algorithms for such domains. To appear in Theory and Practice of Logic Programming (TPLP).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
