arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.5384cs.LO
收藏

基于格的最小不动点逻辑

Lattice based Least Fixed Point Logic

Piotr Filipiuk, Flemming Nielson, Hanne Riis Nielson

摘要:

随着软件系统变得越来越复杂,越来越需要新的静态分析。由于声明式的风格,逻辑编程是一种有吸引力的形式主义来指定它们。然而,以前的工作使用逻辑编程的静态分析集中在分析上定义的一些powerset域,这是非常有限的。在本文中,我们提出了一个逻辑,解除这一限制,称为基于格的最小不动点逻辑(LLFP),它允许在任何完整的格满足升链条件的解释。主要的理论贡献是摩尔家庭的结果,保证总是有一个独特的最小的解决方案为一个给定的问题。另一个贡献是解决算法的发展,计算的最小模型的LLFP公式保证摩尔家庭的结果。

英文摘要:

As software systems become more complex, there is an increasing need for new static analyses. Thanks to the declarative style, logic programming is an attractive formalism for specifying them. However, prior work on using logic programming for static analysis focused on analyses defined over some powerset domain, which is quite limiting. In this paper we present a logic that lifts this restriction, called Lattice based Least Fixed Point Logic (LLFP), that allows interpretations over any complete lattice satisfying Ascending Chain Condition. The main theoretical contribution is a Moore Family result that guarantees that there always is a unique least solution for a given problem. Another contribution is the development of solving algorithm that computes the least model of LLFP formulae guaranteed by the Moore Family result.

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

↑