Static Single Assignment Construction (1995) [9 citations — 0 self]
by
Preston Briggs
,
Tim Harvey
,
Taylor Simpson
Add To MetaCart
Abstract:
this document is to present a generalized implementation of a control-flow graph (CFG) static single assignment (SSA) form converter. This document and the resultant code are intended to be part of the shared code library used in the Massively Scalar Compiler Project. The goal is to provide a central implementation of the SSA conversion algorithm described in Cytron et al., which will handle all of the various "flavors" of SSA form [3]. 1.1 SSA form
Citations
| 644 | Efficiently computing static single assignment form and the control dependence graph – Cytron, Ferrante, et al. - 1991 |
| 14 | The massively scalar compiler project – Briggs - 1994 |
| 9 | Analysis of a simple algorithm for global flow problems – Hecht, Ullman - 1973 |
| 1 | Computing dominators and dominance frontiers – Briggs, Harvey - 1994 |

