Efficient accommodation of may-alias information in SSA form

Ron Cytron, Reid Gershbein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

32 Scopus citations

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.

Original languageEnglish
Title of host publicationProc ACM SIGPLAN 93 Conf Program Lang Des Implementation
PublisherPubl by ACM
Pages36-45
Number of pages10
ISBN (Print)0897915984, 9780897915984
DOIs
StatePublished - 1993
EventProceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation - Albuquerque, NM, USA
Duration: Jun 23 1993Jun 25 1993

Publication series

NameProc ACM SIGPLAN 93 Conf Program Lang Des Implementation

Conference

ConferenceProceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation
CityAlbuquerque, NM, USA
Period06/23/9306/25/93

Fingerprint

Dive into the research topics of 'Efficient accommodation of may-alias information in SSA form'. Together they form a unique fingerprint.

Cite this