1999 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00425) (1999)
Newport Beach, California
Oct. 12, 1999 to Oct. 16, 1999
Tsuneo Nakanishi , Nara Institute of Science and Technology
Akira Fukuda , Nara Institute of Science and Technology
Kazuki Joe , Nara Women's University
Constantine D. Polychronopoulos , University of Illinois at Urbana-Champaign
In this paper, the modulo interval, an extension of the traditional interval on real numbers, and its useful mathematical properties are presented as a representation for program analysis Only with two additional parameters to the interval on real numbers, namely the modulus and the residue, the modulo interval can represent information on program having cyclicity such as loop indices, array subscripts etc. at reasonable complexity and more accuracy. Well-defined arithmetic and set operations on the modulo interval make implementation of compilers simple and reliable. Moreover, application of the modulo interval to program analysis for parallelizing compilers is discussed in this paper.
interval, arithmetic, dependence analysis, program analysis, modulo
K. Joe, C. D. Polychronopoulos, T. Nakanishi and A. Fukuda, "The Modulo Interval: A Simple and Practical Representation for Program Analysis," 1999 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00425)(PACT), Newport Beach, California, 1999, pp. 91.