Zahira Ammarguellat

Learn More
The recognition of recurrence relations is important in several ways to the compilation of programs. Induction variables, the simplest form of recurrence, are pivotal in loop optimizations and dependence testing. Many recurrence relations, although expressed sequentially by the programmer, lend themselves to efficient vector or parallel computation. Despite(More)
We present a simple method for normalizing the control-ow of programs to facilitate program transformations, program analysis, and automatic parallelization. While previous methods result in programs whose control owgraphs are reducible, programs normalized by this technique satisfy a stronger condition than reducibility and are therefore simpler in their(More)
  • 1