Constraint-based array dependence analysis

被引：0

作者：

Univ of Maryland, College Park, United States ^{[1
]}

机构：

来源：

ACM Trans Program Lang Syst | / 3卷 / 635-678期

关键词：

Arrays - Computational complexity - Computer programming - Computer programming languages - Constraint theory - Data storage equipment - Digital arithmetic - Parallel processing systems - Program compilers;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

A constraint language that provides a rich language for communication with the dependence analyzer, by either the programmer or other phases of the compiler is detailed. The worst-case complexity of Presburger Arithmetic indicates that it might be unsuitable for any practical application. However, evidence suggests that analysis of benchmark programs does not cause the exponential growth in the number of constraints that could occur in the worst case. By studying the constraints produced during the analysis, the characteristics that keep the algorithms free of exponential behavior in practice are identified.

引用