The DOI matches its Crossref record.
Parallelizing programs with recursive data structures
Abstract
A study is made of the problem of estimating interference in an imperative language with dynamic data structures. The authors focus on developing efficient and implementable methods for recursive data structures. In particular, they present interference analysis tools and parallelization techniques for imperative programs that contain dynamically updatable trees and directed acyclic graphs. The analysis methods are based on a regular-expression-like representation of the relationship between accessible nodes in the data structure. They authors have implemented their analysis, and they present some concrete examples that have been processed by this system.>
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
Cited by
Context-sensitive interprocedural points-to analysis in the presence of function pointers
Emami, M., Ghiya, R., & Hendren, L. J. (1994) · Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation · doi:10.1145/178243.178264 · Cited by 570
Self-citationEfficient context-sensitive pointer analysis for C programs
Wilson, R. P., & Lam, M. S. (1995) · ACM SIGPLAN Notices · doi:10.1145/223428.207111 · Cited by 539
Manufacturing cheap, resilient, and stealthy opaque constructs
Collberg, C., Thomborson, C., & Low, D. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268962 · Cited by 535
Efficient context-sensitive pointer analysis for C programs
Wilson, R. P., & Lam, M. S. (1995) · Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation · doi:10.1145/207110.207111 · Cited by 458
Analysis of pointers and structures
Chase, D., Wegman, M., & Zadeck, F. K. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989429 · Cited by 433
Interprocedural may-alias analysis for pointers: beyond k -limiting
Deutsch, A. (1994) · Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation · doi:10.1145/178243.178263 · Cited by 328
Solving shape-analysis problems in languages with destructive updating
Sagiv, M., Reps, T., & Wilhelm, R. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271517 · Cited by 322
The tao of parallelism in algorithms
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., et al. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993501 · Cited by 312
Analysis of pointers and structures
Chase, D. R., Wegman, M., & Zadeck, F. K. (1990) · Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90 · doi:10.1145/93542.93585 · Cited by 303
Is 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
Self-citationAutomatic 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
Automatic Parallelization of Recursive Procedures
Gupta, M., Mukhopadhyay, S., & Sinha, N. (2000) · International Journal of Parallel Programming · doi:10.1023/a:1007560600904 · Cited by 44
“Several researchers have used pointer analysis to recognize parallelism in programs that use linked data structures like trees and linked lists [14] [19].”
Background
Metadata
- Authors
- Hendren, L. J., & Nicolau, A.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 1990
- Volume
- 1
- Issue
- 1
- Pages
- 35-47
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W237536699
- Cited by
- 219
- References
- 0
- FWCI
- 13.61
- 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
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.