Document Type

Technical Report

Publication Date

1992-12-01

Filename

WUCS-92-48.pdf

Technical Report Number

WUCS-92-48

Abstract

We present an algorithm for incrementally including may-alias information into Static Single Assignment form by computing a sequence of increasingly precise (and correspondingly larger) partial SSA forms. Our experiments show significant speedup of our method over exhaustive use of may-alias information, as optimization problems converge well before most may-aliases are needed.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7F47MHG

Share

COinS