Interprocedural induction variable analysis

Peiyi Tang, Pen Chung Yew

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Induction variable analysis is an important part of the symbolic analysis in parallelizing compilers. Induction variables can be formed by for or $\mathtt{DO}$ loops within procedures or loops of recursive procedure calls. This paper presents an algorithm to find induction variables in formal parameters of procedures caused by recursive procedure calls. The compiletime knowledge of induction variables in formal parameters is essential to summarize array sections to be used for data dependence test and parallelization.

Original languageEnglish (US)
Pages (from-to)405-423
Number of pages19
JournalInternational Journal of Foundations of Computer Science
Issue number3
StatePublished - 2003


  • Interprocedural induction variables
  • call graphs
  • extended full program representation (EFPR) graphs
  • induction variable analysis
  • interprodural factored usedef (IFUD) graphs
  • recursive procedure call


Dive into the research topics of 'Interprocedural induction variable analysis'. Together they form a unique fingerprint.

Cite this