Mode Analysis Domains for Typed Logic Programs
Mode Analysis Domains for Typed Logic Programs
复制标题
类型化逻辑程序的模式分析域
DOI：
10.1007/10720327_6
复制
发表时间：
1999
影响因子：
2
通讯作者：
A. King
中科院分区：
文献类型：
--
作者：
J. Smaus;P. Hill;A. King
精确的模式信息对于编译器优化和程序开发工具是重要的。在抽象编译的框架内，模式分析的精确度部分取决于抽象域及其相关抽象函数的表达能力。本文认为抽象域多态类型的逻辑程序，并显示如何专门域可能会被构造为每种类型的程序。这些域以高精度捕获实例化的程度。通过提供抽象统一的通用定义，使用这些域的程序的抽象是正式的。域的建设过程是完全实现使用Godel语言和测试的一些示例程序，以证明该方法的可行性。
Precise mode information is important for compiler optimisations and in program development tools. Within the framework of abstract compilation, the precision of a mode analysis depends, in part, on the expressiveness of the abstract domain and its associated abstraction function. This paper considers abstract domains for polymorphically typed logic programs and shows how specialised domains may be constructed for each type in the program. These domains capture the degree of instantiation to a high level of precision. By providing a generic definition of abstract unification, the abstraction of a program using these domains is formalised. The domain construction procedure is fully implemented using the Godel language and tested on a number of example programs to demonstrate the viability of the approach.