Simple generation of static single-assignment form

Abstract

The static single-assignment (SSA) form of a program provides data flow information in a form which makes some compiler optimizations easy to perform. In this paper we present a new, simple method for convertingto SSA form, which produces correct solutions for nonreducible control-flow graphs, and produces minimal solutions for reducible ones. Our timingresu lts show that, despite its simplicity, our algorithm is competitive with more established techniques.