The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Dependence graphs and compiler optimizations
Open accessAbstract
Dependence graphs can be used as a vehicle for formulating and implementing compiler optimizations. This paper defines such graphs and discusses two kinds of transformations. The first are simple rewriting transformations that remove dependence arcs. The second are abstraction transformations that deal more globally with a dependence graph. These transformations have been implemented and applied to several different types of high-speed architectures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The Theory of Parsing, Translation, and Compiling
Aho, A. V., & Ullman, J. D. (1972) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,395
Flow diagrams, turing machines and languages with only two formation rules
Böhm, C., & Jacopini, G. (1966) · Communications of the ACM · doi:10.1145/355592.365646 · Cited by 791
Compiler construction for digital computers
Gries, D. J. (1971) · International Linear Collider · Cited by 504
The Structure of Computers and Computations
Kuck, D. L. (1978) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 492
Self-citationHigh-Speed Multiprocessors and Compilation Techniques
Padua, Kuck, & Lawrie (1980) · IEEE Transactions on Computers · doi:10.1109/tc.1980.1675676 · Cited by 270
Kuck, D. J., Muraoka, Y., & Chen, S.-C. (1972) · IEEE Transactions on Computers · doi:10.1109/t-c.1972.223501 · Cited by 225
Self-citationAn asynchronous programming language and computing machine
Arvind, A., Gostelow, K. P., & Plouffe, W. (1978) · eScholarship (California Digital Library) · Cited by 207
A Fast and Usually Linear Algorithm for Global Flow Analysis
Graham, S. L., & Wegman, M. (1976) · Journal of the ACM · doi:10.1145/321921.321939 · Cited by 187
An Algorithm for Structuring Flowgraphs
Baker, B. S. (1977) · Journal of the ACM · doi:10.1145/321992.321999 · Cited by 108
VAL -- A Value-Oriented Algorithmic Language (Preliminary Reference Manual),
Ackerman, W. B., & Dennis, J. B. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 52
Automatic program transformations for virtual memory computers
Abu-Sufah, W., Kuck, D. J., & Lawrie, D. H. (1979) · International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817192 · Cited by 43
Self-citationCompiler assignment of data items to registers
Day, W. H. (1970) · IBM Systems Journal · doi:10.1147/sj.94.0281 · Cited by 24
Cited by
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
Software pipelining: an effective scheduling technique for VLIW machines
Lam, M. S. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989420 · Cited by 884
Agrawal, H., & Horgan, J. R. (1990) · Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90 · doi:10.1145/93542.93576 · Cited by 867
Pegasus, a workflow management system for science automation
Deelman, E., Vahi, K., Juve, G., Rynge, M., Callaghan, S., Maechling, P. J., Mayani, R., Chen, W., Ferreira da Silva, R., Livny, M., et al. (2015) · Future Generation Computer Systems · doi:10.1016/j.future.2014.10.008 · Cited by 861
“This well-known, DAG based declarative approach has been used extensively to represent computations from single processor systems, to multi-CPU and multi-core systems, and databases [9] [10] [11] [12] [13] [14].”
MethodSPIRAL: Code Generation for DSP Transforms
Puschel, M., Moura, J. M. F., Johnson, J. R., Padua, D., Veloso, M. M., Singer, B. W., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., et al. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840306 · Cited by 826
Self-citation
Metadata
- Authors
- Kuck, D. J., Kuhn, R. H., Padua, D. A., Leasure, B., & Wolfe, M.
- Venue
- Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81
- Publisher
- ACM Press
- Published
- 1981
- Pages
- 207-218
- OpenAlex
- W2043555680
- Cited by
- 651
- References
- 13
- FWCI
- 9.09
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
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.