共享与线性分析的最优匹配
Optimal matching for sharing and linearity analysis
AI总结:
本文研究逻辑程序静态分析中共享与线性属性的最优抽象匹配算子,提出$\mathtt{ShLin}^\omega$域上的最优算子,可实例化用于$\mathtt{ShLin}^{2}$和$\mathtt{Sharing} \times \mathtt{Lin}$域。
摘要:
通过抽象解释对逻辑程序进行静态分析,需要设计模拟具体算子(如合一、重命名和投影)的抽象算子。在目标驱动分析(使用目标依赖语义)的情况下,我们还需要一个后向合一算子,通常通过匹配来实现。本文研究了为共享和线性属性推导最优抽象匹配算子的问题。我们在域${\mathtt{ShLin}^\omega}$中提供了一个最优匹配算子,该算子可以轻松实例化,以为Andy King提出的域${\mathtt{ShLin}^{2}}$以及简化积$\mathtt{Sharing} \times \mathtt{Lin}$推导出最优算子。
英文摘要:
Static analysis of logic programs by abstract interpretation requires designing abstract operators which mimic the concrete ones, such as unification, renaming and projection. In the case of goal-driven analysis, where goal-dependent semantics are used, we also need a backward-unification operator, typically implemented through matching. In this paper we study the problem of deriving optimal abstract matching operators for sharing and linearity properties. We provide an optimal operator for matching in the domain ${\mathtt{ShLin}^ω}$, which can be easily instantiated to derive optimal operators for the domains ${\mathtt{ShLin}^{2}}$ by Andy King and the reduced product $\mathtt{Sharing} \times \mathtt{Lin}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。