SSA form

Static Single Assignment (SSA) is an Intermediate language[?] form used by compilers to simplify (some) optimization algorithms. Developed by researchers at IBM in the 80's. Each variable is only defined once, a redefinition of a variable is considered to be a new variable (version). The use-def chains are reduced to a pointer to the single definition of the variable.

Examples of algorithms that are made easy using SSA form are:

• dead code elimination,
• constant propagation,
• partial redundancy elimination.

See Alse: Compiler optimization