逻辑程序更精确而有效的类型推断
More Precise Yet Efficient Type Inference for Logic Programs
摘要:
逻辑程序的类型分析,旨在推断被分析的程序的类型提出了一个统一的抽象解释为基础的框架。这涵盖了大多数经典的基于抽象解释的逻辑程序类型分析器,建立在程序的自顶向下或自底向上解释之上。在这种情况下,我们讨论加宽运算符,可以说是一个关键的。我们提出了一个新的扩大,这是比以前提出的更精确。与我们的分析域的实际结果,也表明,它也允许有效的分析。
英文摘要:
Type analyses of logic programs which aim at inferring the types of the program being analyzed are presented in a unified abstract interpretation-based framework. This covers most classical abstract interpretation-based type analyzers for logic programs, built on either top-down or bottom-up interpretation of the program. In this setting, we discuss the widening operator, arguably a crucial one. We present a new widening which is more precise than those previously proposed. Practical results with our analysis domain are also presented, showing that it also allows for efficient analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。