Cytron and colleagues: dominance frontiers for constructing SSA and control dependence

What changed

Cytron, Ferrante, Rosen, Wegman and Zadeck used dominance frontiers to place merge functions and rename variables into minimal static single-assignment form, and reused the reverse-graph construction to compute control dependence.

Scientific scope

Cytron, Ferrante, Rosen, Wegman and Zadeck used dominance frontiers to place merge functions and rename variables into minimal static single-assignment form, and reused the reverse-graph construction to compute control dependence. The construction assumes the stated reachable-entry/exit control-flow graph, definitions and modeling of implicit effects. The paper’s minimal SSA notion differs from liveness-pruned SSA. Output/frontier size can make general construction costs larger than a simple linear claim; restricted structured programs are a narrower case. Aliasing, renaming semantics and complete compiler correctness need separate treatment. Reported compiler observations have not been reproduced here.

Evidence

Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.

Contributors

• Ron Cytron · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
• Jeanne Ferrante · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
• Barry K. Rosen · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
• Mark N. Wegman · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
• F. Kenneth Zadeck · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.

• Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction