Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Simple Generation of Static Single-Assignment John Aycock and Nigel Horspool
 

Summary: Simple Generation of Static Single-Assignment
Form
John Aycock and Nigel Horspool
Department of Computer Science,
University of Victoria,
Victoria, B. C., Canada V8W 3P6
faycock,nigelhg@csc.uvic.ca
c
Springer-Verlag
Abstract. The static single-assignment (SSA) form of a program pro-
vides data ow information in a form which makes some compiler opti-
mizations easy to perform. In this paper we present a new, simple method
for converting to SSA form, which produces correct solutions for nonre-
ducible control- ow graphs, and produces minimal solutions for reducible
ones. Our timing results show that, despite its simplicity, our algorithm
is competitive with more established techniques.
1 Introduction
The static single-assignment (SSA) form is a program representation in which
variables are split into \instances." Every new assignment to a variable | or
more generally, every new de nition of a variable | results in a new instance.

  

Source: Aycock, John - Department of Computer Science, University of Calgary

 

Collections: Computer Technologies and Information Sciences