{"doi":"10.1145/360018.360025","title":"A program data flow analysis procedure","abstract":"<jats:p>The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper. A procedure is given which determines all the definitions which can possibly “reach” each node of the control flow graph of the program and all the definitions that are “live” on each edge of the graph. The procedure uses an “interval” ordered edge listing data structure and handles reducible and irreducible graphs indistinguishably.</jats:p>","journal":"Communications of the ACM","year":1976,"id":28325,"datarank":29.82371493368672,"base_score":6.016157159698354,"endowment":6.016157159698354,"self_citation_contribution":0.9024235739547533,"citation_network_contribution":28.921291359731967,"self_endowment_contribution":0.9024235739547533,"citer_contribution":28.921291359731967,"corpus_percentile":null,"corpus_rank":null,"citation_count":409,"citer_count":200,"citers_with_citation_signal":200,"citers_with_endowment":200,"datacite_reuse_total":1,"is_dataset":false,"is_dataset_confidence":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":158969,"name":"J. Cocke","orcid":null,"position":1,"is_corresponding":false},{"id":158968,"name":"F. E. Allen","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":6.016157159698354,"endowment":6.016157159698354,"datacite_reuse_total":1,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W2162436812","authors":[],"funders":[],"total_grants":0,"fwci":28.4054,"citation_percentile":1.0,"influential_citations":21,"citation_trend":[{"year":2012,"count":8},{"year":2013,"count":10},{"year":2014,"count":13},{"year":2015,"count":11},{"year":2016,"count":8},{"year":2017,"count":12},{"year":2018,"count":5},{"year":2019,"count":3},{"year":2020,"count":10},{"year":2021,"count":7},{"year":2022,"count":7},{"year":2023,"count":6},{"year":2024,"count":12},{"year":2025,"count":8},{"year":2026,"count":4}],"oa_status":"bronze","license":"https://www.acm.org/publications/policies/copyright_policy#Background","oa_locations":[{"url":"https://dl.acm.org/doi/pdf/10.1145/360018.360025","host_type":"journal"},{"url":"https://dl.acm.org/doi/pdf/10.1145/360018.360025","host_type":"BRONZE"},{"url":"https://dl.acm.org/doi/pdf/10.1145/360018.360025","host_type":"publisher"},{"url":"https://dl.acm.org/doi/10.1145/360018.360025","host_type":"publisher"},{"url":"https://doi.org/10.1145/360018.360025","host_type":"journal"}],"fields_of_study":["Parallel Computing and Optimization Techniques","Algorithms and Data Compression","Distributed systems and fault tolerance","Computer Science"],"mesh_terms":[],"keywords":["Control flow graph","Data-flow analysis","Computer science","Program analysis","Call graph","Graph","Listing (finance)","Control flow analysis","Control flow","Data flow diagram","Static analysis","Enhanced Data Rates for GSM Evolution","Theoretical computer science","Data structure","Interval arithmetic","Algorithm","Programming language","Mathematics","Database","Artificial intelligence","Declarative programming"],"sdg_mappings":[],"linked_datasets":[{"doi":"10.4230/oasics.slate.2023.11","title":"Hierarchical Data-Flow Graphs","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T21:16:30.074423Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}