Abstract
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 language | English (US) |
|---|---|
| Pages (from-to) | 405-423 |
| Number of pages | 19 |
| Journal | International Journal of Foundations of Computer Science |
| Volume | 14 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2003 |
Keywords
- Interprocedural induction variables
- call graphs
- extended full program representation (EFPR) graphs
- induction variable analysis
- interprodural factored usedef (IFUD) graphs
- recursive procedure call