The DOI matches its Crossref record.
A practical algorithm for exact array dependence analysis
Open accessAbstract
ndamental analis step in an ad-',nced optimizing compiler (as well as many other software tools) is data dependence analysis for arrays.This means deciding if two references to an array can refer to the same element and if so, under what conditions.This information is used to determine allowable program transformations and optimizations.For example, we can determine that in the following code fragment, no location of the array is both read and written.Once we also verify that no location is written more than once, we know that the writes can be done in any order.for i= 1 to 100 do forj --i to 100 do A [i, j+ 11 = A[100,j]
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
Cited by
Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution
Xie, T., Marinov, D., Schulte, W., & Notkin, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31980-1_24 · Cited by 287
A practical automatic polyhedral parallelizer and locality optimizer
Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P. (2008) · ACM SIGPLAN Notices · doi:10.1145/1379022.1375595 · Cited by 248
Metadata
- Authors
- Pugh, W.
- Venue
- Communications of the ACM
- Published
- 1992-08
- Volume
- 35
- Issue
- 8
- Pages
- 102-114
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2132331020
- Cited by
- 568
- References
- 0
- FWCI
- 22.35
- Type
- journal article
- 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
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 practical algorithm for exact array dependence analysis. https://app.cochat.ai/papers/10.1145/135226.135233
- The paper
- Pugh, W. (1992). A practical algorithm for exact array dependence analysis. Communications of the ACM. https://doi.org/10.1145/135226.135233
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.