The Modulo Interval: A Simple and Practical Representation for Program Analysis

Authors:
Tsuneo Nakanishi;Akira Fukuda;Kazuki Joe;Constantine D. Polychronopoulos
Affiliations:
-;-;-;-
Venue:
PACT '99 Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques
Year:
1999

Citing 0
Cited 3

The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

Science of Computer Programming
Exact join detection for convex polyhedra and other numerical abstractions

Computational Geometry: Theory and Applications
Modulo intervals: a proposed notation

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.