The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Analysis of pointers and structures
Abstract
article Analysis of pointers and structures Authors: David Chase Menlo Park, CA Menlo Park, CAView Profile , Mark Wegman IBM T.J. Watson Research Center, Yorktown Heights, NY IBM T.J. Watson Research Center, Yorktown Heights, NYView Profile , F. Ken Zadeck Brown University, Providence, RI Brown University, Providence, RIView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 39Issue 4April 2004 pp 343–359https://doi.org/10.1145/989393.989429Published:01 April 2004Publication History 0citation587DownloadsMetricsTotal Citations0Total Downloads587Last 12 Months5Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
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
Efficiently computing static single assignment form and the control dependence graph
Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., & Zadeck, F. K. (1991) · ACM Transactions on Programming Languages and Systems · doi:10.1145/115372.115320 · Cited by 2,267
Self-citationAn efficient, incremental, automatic garbage collector
Deutsch, L. P., & Bobrow, D. G. (1976) · Communications of the ACM · doi:10.1145/360336.360345 · Cited by 255
Dependence analysis for pointer variables
Horwitz, S., Pfeiffer, P., & Reps, T. (1989) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/73141.74821 · Cited by 233
Parallelizing programs with recursive data structures
Hendren, L. J., & Nicolau, A. (1990) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.80123 · Cited by 219
Detecting conflicts between structure accesses
Larus, J. R., & Hilfinger, P. N. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.53993 · Cited by 213
Jones, N. D., & Muchnick, S. S. (1982) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/582153.582161 · Cited by 213
A precise inter-procedural data flow algorithm
Myers, E. M. (1981) · Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81 · doi:10.1145/567532.567556 · Cited by 211
A semantic model of reference counting and its abstraction (detailed summary)
Hudak, P. (1986) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/319838.319876 · Cited by 141
Lifetime analysis of dynamically allocated objects
Ruggieri, C., & Murtagh, T. (1988) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/73560.73585 · Cited by 113
Solving shape-analysis problems in languages with destructive updating
Sagiv, M., Reps, T., & Wilhelm, R. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237725 · Cited by 109
Cited by
Efficiently computing static single assignment form and the control dependence graph
Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., & Zadeck, F. K. (1991) · ACM Transactions on Programming Languages and Systems · doi:10.1145/115372.115320 · Cited by 2,267
Self-citationIs it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C
Ghiya, R., & Hendren, L. J. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237724 · Cited by 287
Automatic parallelization of divide and conquer algorithms
Rugina, R., & Rinard, M. (1999) · Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/301104.301111 · Cited by 103
Metadata
- Authors
- Chase, D., Wegman, M., & Zadeck, F. K.
- Venue
- ACM SIGPLAN Notices
- Published
- 2004-04
- Volume
- 39
- Issue
- 4
- Pages
- 343-359
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W1975914482
- Cited by
- 433
- References
- 13
- FWCI
- 29.48
- Type
- journal article
- 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: Analysis of pointers and structures. https://app.cochat.ai/papers/10.1145/989393.989429
- The paper
- Chase, D., Wegman, M., & Zadeck, F. K. (2004). Analysis of pointers and structures. ACM SIGPLAN Notices. https://doi.org/10.1145/989393.989429
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.
