High-level languages could be optimized significantly if compilers could determine
automatically how pointers and heap allocated structures are used. Setter knowledge of
aliasing can improve classical optimizations applied to scalars (common sub-expression
elimination, loop-invariant code motion, reduction in st. rength, constant propagation) by
permitting less conservative assumptions about what is affected by an update to stor, age,
and can aid in dependence analysis for purposes of parallelization. In addition, information …

Historically our paper was important because it demonstrated that it was possible to get
useful information about linked data structures in a practical amount of time. At the time of
publication, there was some interest in pointer analysis from the theoretical community, but
these algorithms were generally impractical. Our paper presented a technique that
combined a clever lattice representation of pointer information with an incremental algorithm
for updating SSA (static single assignment form) on the fly. This set the stage for significant …