Summary: Simple Generation of Static Single-Assignment
John Aycock and Nigel Horspool
Department of Computer Science,
University of Victoria,
Victoria, B. C., Canada V8W 3P6
Abstract. The static single-assignment (SSA) form of a program pro-
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-
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.
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 denition of a variable | results in a new instance.