利用非判别联合提高类型分析的精度
Improving Precision of Type Analysis Using Non-Discriminative Union
摘要：
本文提出了一种新的逻辑程序类型分析方法。分析是用先验类型定义进行的;类型表达式是由类型构造函数的固定字母表形成的。非歧视联合用于连接来自不同来源的类型信息，而不会损失精度。在分析期间重复执行的操作是检测是否已达到固定点。这被简化为检查类型是否为空。由于使用了非歧视联合，检查类型的空性的基本问题是更复杂的类型分析比其他类型分析与先验类型定义。然而，实验结果表明，使用制表减少了一组基准上的分析时间的一小部分的影响。关键词：类型分析，非歧视并，抽象解释，制表
英文摘要：
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type information from different sources without loss of precision. An operation that is performed repeatedly during an analysis is to detect if a fixpoint has been reached. This is reduced to checking the emptiness of types. Due to the use of non-discriminative union, the fundamental problem of checking the emptiness of types is more complex in the proposed type analysis than in other type analyses with a priori type definitions. The experimental results, however, show that use of tabling reduces the effect to a small fraction of analysis time on a set of benchmarks. Keywords: Type analysis, Non-discriminative union, Abstract interpretation, Tabling
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
