Efficiently Computing Static Single Assignment Form and the Control Dependence Graph.¶
Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., & Zadeck, F. K. (1991). Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM Transactions on Programming Languages and Systems, 13(4), 451-490.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Canonical Form
- In compilers it is static single assignment form, which gives every variable exactly one assignment and makes dataflow analyses trivially expressible, along with A-normal form and three-address code.
This sourceCanonical reference for SSA form enabling dataflow analyses.
- In compilers it is static single assignment form, which gives every variable exactly one assignment and makes dataflow analyses trivially expressible, along with A-normal form and three-address code.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:632fff0bb8aa · see in the full table