Static single assignment (SSA) form facilitates compiler optimizations. 1 Static single assignment form (SSA form) 1: a = x + y 2: a = a + 3 3: b = x + y Static single assignment (SSA) form (a) Normal (conventional) form (source program or internal form) 1: a1 = x0 + y0 2: a2 = a1 + 3 3: b1 = x0

In this technical report, we present an architecture for register allocation on the SSA-form. We show, how the properties of SSA-form programs and their interference graphs can be exploited to develop new methods for spilling, coloring and coalescing. We present heuristic and optimal solution

as its interference graph. In this paper, we show that interference graphs of programs in SSA-form are chordal. 1

This paper presents a new approach called SSAPRE [Chow et al. 1997] that shares the optimality properties of the best prior work [Knoop et al. 1992; Knoop et al. 1994; Drechsler and Stadel 1993] and that is based on static single assignment form. Static single assignment form (SSA) is a popular

Static single assignment (SSA) form for scalars has been a significant advance. It has simplified the way we think about scalar variables. It has simplified the design of some optimizations and has made other optimizations more effective. Unfortunately none of this can be said for SSA form

The linear scan algorithm for register allocation provides a good register assignment with a low compilation overhead and is thus frequently used for just-in-time compilers. Although most of these compilers use static single assignment (SSA) form, the algorithm has not yet been applied on SSA form

Static single assignment (SSA) form for scalars has been a significant advance. It has simplified the way we think about scalar variables. It has simpliied the design of some optimizations and has made other optimizations more ef-fective. Unfortunately none of thii can be be said for SSA form

We have constructed a simple yet powerful code optimizer that uses SSA form in concert with table-driven techniques for peephole optimization and code generation. This paper describes the problems with data dependences and 2-address instructions we encountered in combining these two techniques

We present an algorithm for incrementally including may-alias information into Static Single Assignment (SSA) 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

Compilation for embedded processors can be either aggressive (time consuming cross-compilation) or just in time (embedded and usually dynamic). The heuristics used in dynamic compilation are highly constrained by limited resources, time and memory in particular. Recent results on the SSA form open