Computer_Science
 Home | People | Curriculum | Projects | Resources | Media
Traditional scalar optimizations such as dead code elimination and constant propagation are not usually applied to array variables, becaues these optimizations require information about data flow and standard array dependence analysis gives only information about memory aliasing. I have developed generalizations of some traditional optimizations for arrays, based on the dataflow information produced by my analysis algorithms.

This work was presented at LCPC 2000; an early description of my generalizations is available as a Technical Report from Rutgers University DCS (where I spent part of my junior leave).

Haverford College Page maintained by John Dougherty, David Wonnacott, and Rachel Heaton.
Computer Science Department, Haverford College.