{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "cytron-dominance-frontier-ssa-construction-1991",
    "title": "Cytron and colleagues: dominance frontiers for constructing SSA and control dependence",
    "summary": "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.\n\nCompilers need to know which assignment supplies the value used at a particular place. Static single-assignment form gives every variable name one defining assignment. Branches and loops still require merge functions: a φ-function chooses the value arriving along the predecessor edge actually followed. This 1991 paper provides a dominance-frontier construction for placing those functions. A frontier identifies where control can leave a region dominated by an assignment. Placement must repeat through the frontiers of newly introduced merge functions; a single pass can miss later merges. A dominator-tree traversal then renames assignments and uses while preserving their values along control-flow paths. Reversing the graph lets the same machinery describe control dependence. The paper assumes normalized control-flow graphs whose nodes are reachable from Entry and can reach Exit, with implicit uses and modifications made explicit or conservatively modeled. It shows favorable results for restricted structured programs and reports measurements on 221 FORTRAN procedures. This is not a universal linear worst-case claim: its one-parameter bounds are quadratic for frontier construction and cubic for SSA translation. SSA and control dependence had antecedents; the assessed advance is the construction framework and analysis, not invention of every underlying concept.",
    "boundary": "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.",
    "area": "Computing",
    "topic": "Compiler intermediate representations and program analysis",
    "year": 1991,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "cytron-dominance-frontier-ssa-construction-1991",
    "target": {
      "record_id": "urn:uuid:e25d41bd-1409-4398-a1cd-aa605a1ae84c",
      "version": 1,
      "content_hash": "sha256:481b6a57d5d9cb67ab5d84b1f98984083b575c9cec09f6c35461c80969099167"
    },
    "humans": [
      "Ron Cytron",
      "Jeanne Ferrante",
      "Barry K. Rosen",
      "Mark N. Wegman",
      "F. Kenneth Zadeck"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-cytron-dominance-frontier-ssa-construction-1991-original",
        "title": "Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original",
        "url": "https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf"
      }
    ],
    "points": "210000",
    "published_grade": {
      "id": "cytron-dominance-frontier-ssa-construction-1991",
      "entry_id": "cytron-dominance-frontier-ssa-construction-1991",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:e25d41bd-1409-4398-a1cd-aa605a1ae84c",
        "version": 1,
        "content_hash": "sha256:481b6a57d5d9cb67ab5d84b1f98984083b575c9cec09f6c35461c80969099167"
      },
      "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.",
      "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.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:e25d41bd-1409-4398-a1cd-aa605a1ae84c",
        "version": 1,
        "content_hash": "sha256:481b6a57d5d9cb67ab5d84b1f98984083b575c9cec09f6c35461c80969099167"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Ron Cytron",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original",
            "url": "https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Jeanne Ferrante",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original",
            "url": "https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Barry K. Rosen",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original",
            "url": "https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Mark N. Wegman",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original",
            "url": "https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "F. Kenneth Zadeck",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original",
            "url": "https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original",
            "url": "https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "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.",
        "domain": "Computing"
      },
      "sources": [
        {
          "citation": "Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original",
          "url": "https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf"
        }
      ],
      "statement": "# Cytron and colleagues: dominance frontiers for constructing SSA and control dependence\n\nCytron, 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.\n\nCompilers need to know which assignment supplies the value used at a particular place. Static single-assignment form gives every variable name one defining assignment. Branches and loops still require merge functions: a φ-function chooses the value arriving along the predecessor edge actually followed. This 1991 paper provides a dominance-frontier construction for placing those functions. A frontier identifies where control can leave a region dominated by an assignment. Placement must repeat through the frontiers of newly introduced merge functions; a single pass can miss later merges. A dominator-tree traversal then renames assignments and uses while preserving their values along control-flow paths. Reversing the graph lets the same machinery describe control dependence. The paper assumes normalized control-flow graphs whose nodes are reachable from Entry and can reach Exit, with implicit uses and modifications made explicit or conservatively modeled. It shows favorable results for restricted structured programs and reports measurements on 221 FORTRAN procedures. This is not a universal linear worst-case claim: its one-parameter bounds are quadratic for frontier construction and cubic for SSA translation. SSA and control dependence had antecedents; the assessed advance is the construction framework and analysis, not invention of every underlying concept.\n\n## Scientific scope\n\nThe 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.\n\n## People and systems\n\nRon Cytron; Jeanne Ferrante; Barry K. Rosen; Mark N. Wegman; F. Kenneth Zadeck\n\n\n\n## Original sources\n\n- [Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original](https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf)\n",
      "summary": "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.\n\nCompilers need to know which assignment supplies the value used at a particular place. Static single-assignment form gives every variable name one defining assignment. Branches and loops still require merge functions: a φ-function chooses the value arriving along the predecessor edge actually followed. This 1991 paper provides a dominance-frontier construction for placing those functions. A frontier identifies where control can leave a region dominated by an assignment. Placement must repeat through the frontiers of newly introduced merge functions; a single pass can miss later merges. A dominator-tree traversal then renames assignments and uses while preserving their values along control-flow paths. Reversing the graph lets the same machinery describe control dependence. The paper assumes normalized control-flow graphs whose nodes are reachable from Entry and can reach Exit, with implicit uses and modifications made explicit or conservatively modeled. It shows favorable results for restricted structured programs and reports measurements on 221 FORTRAN procedures. This is not a universal linear worst-case claim: its one-parameter bounds are quadratic for frontier construction and cubic for SSA translation. SSA and control dependence had antecedents; the assessed advance is the construction framework and analysis, not invention of every underlying concept.",
      "title": "Cytron and colleagues: dominance frontiers for constructing SSA and control dependence"
    },
    "record_id": "urn:uuid:e25d41bd-1409-4398-a1cd-aa605a1ae84c",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:e25d41bd-1409-4398-a1cd-aa605a1ae84c",
      "version": 1,
      "content_hash": "sha256:481b6a57d5d9cb67ab5d84b1f98984083b575c9cec09f6c35461c80969099167"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:2641c89e0c1932d97eff25210aaf45110aacde0f19a6a97fc0b6ad0b2298bc83"
  },
  "target": {
    "record_id": "urn:uuid:e25d41bd-1409-4398-a1cd-aa605a1ae84c",
    "version": 1,
    "content_hash": "sha256:481b6a57d5d9cb67ab5d84b1f98984083b575c9cec09f6c35461c80969099167"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "cytron-dominance-frontier-ssa-construction-1991",
    "entry_id": "cytron-dominance-frontier-ssa-construction-1991",
    "revision": 1,
    "title": "Cytron and colleagues: dominance frontiers for constructing SSA and control dependence",
    "context": "Computing",
    "track": "Computing",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "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.",
    "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_summary": "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.",
    "references": [
      {
        "title": "Cytron, Ferrante, Rosen, Wegman and Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph (1991) — complete original",
        "url": "https://rsim.cs.uiuc.edu/arch/qual_papers/compilers/toplas91.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Ron Cytron",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "Jeanne Ferrante",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "Barry K. Rosen",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "Mark N. Wegman",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "F. Kenneth Zadeck",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:e25d41bd-1409-4398-a1cd-aa605a1ae84c",
      "version": 1,
      "content_hash": "sha256:481b6a57d5d9cb67ab5d84b1f98984083b575c9cec09f6c35461c80969099167"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "210000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}