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.
Supported in partVerified against the work's full text
Cytron et al. define SSA as one assignment per variable and say it benefits data-flow representation, but they do not cover A-normal form or three-address code or call analyses trivial.
“A single program is defined to be in SSA form if each variable is a target of exactly one assignment statement in the program text.”
- 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¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:632fff0bb8aa · see in the full table