Modulo interval: A simple and practical representation for program analysis

Tsuneo Nakanishi, Kazuki Joe, Constantine D. Polychronopoulos, Akira Fukuda

Research output: Contribution to journalConference articlepeer-review

6 Citations (Scopus)


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 programs 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.

Original languageEnglish
Pages (from-to)91-96
Number of pages6
JournalParallel Architectures and Compilation Techniques - Conference Proceedings, PACT
Publication statusPublished - 1999
Externally publishedYes
EventPorceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques (PACT '99) - Newport Beach, CA, USA
Duration: Oct 12 1999Oct 16 1999

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture


Dive into the research topics of 'Modulo interval: A simple and practical representation for program analysis'. Together they form a unique fingerprint.

Cite this