The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
A unified approach to global program optimization
Abstract
A technique is presented for global analysis of program structure in order to perform compile time optimization of object code generated for expressions. The global expression optimization presented includes constant propagation, common subexpression elimination, elimination of redundant register load operations, and live expression analysis. A general purpose program flow analysis algorithm is developed which depends upon the existence of an "optimizing function." The algorithm is defined formally using a directed graph model of program flow structure, and is shown to be correct. Several optimizing functions are defined which, when used in conjunction with the flow analysis algorithm, provide the various forms of code optimization. The flow analysis algorithm is sufficiently general that additional functions can easily be defined for other forms of global code optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Allen, F. E. (1970) · ACM SIGPLAN Notices · doi:10.1145/390013.808479 · Cited by 738
Compiler construction for digital computers
Gries, D. J. (1971) · International Linear Collider · Cited by 446
Programming languages and their compilers: Preliminary notes
Cocke, J. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 372
The Generation of Optimal Code for Arithmetic Expressions
Sethi, R., & Ullman, J. D. (1970) · Journal of the ACM · doi:10.1145/321607.321620 · Cited by 299
McKeeman, W. M. (1965) · Communications of the ACM · doi:10.1145/364995.365000 · Cited by 158
An algorithm for coding efficient arithmetic operations
Floyd, R. W. (1961) · Communications of the ACM · doi:10.1145/366062.366082 · Cited by 29
Compiler assignment of data items to registers
Day, W. H. (1970) · IBM Systems Journal · doi:10.1147/sj.94.0281 · Cited by 24
A note on some compiling algorithms
Anderson, J. P. (1964) · Communications of the ACM · doi:10.1145/363958.363976 · Cited by 21
Compiling Techniques for Algebraic Expressions
Huskey, H. D. (1961) · The Computer Journal · doi:10.1093/comjnl/4.1.10 · Cited by 9
Cited by
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
Systematic design of program analysis frameworks
Cousot, P., & Cousot, R. (1979) · Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79 · doi:10.1145/567752.567778 · Cited by 1,621
Abstract interpretation and application to logic programs
Cousot, P., & Cousot, R. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90030-7 · Cited by 582
The essence of command injection attacks in web applications
Su, Z., & Wassermann, G. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111070 · Cited by 515
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation · doi:10.1145/781131.781153 · Cited by 330
Metadata
- Authors
- Kildall, G. A.
- Venue
- Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73
- Publisher
- ACM Press
- Published
- 1973
- Pages
- 194-206
- OpenAlex
- W2124153277
- Cited by
- 916
- References
- 9
- FWCI
- 9.28
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A unified approach to global program optimization. https://app.cochat.ai/papers/10.1145/512927.512945
- The paper
- Kildall, G. A. (1973). A unified approach to global program optimization. Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73. https://doi.org/10.1145/512927.512945
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
