The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Context-sensitive interprocedural points-to analysis in the presence of function pointers
Abstract
This paper reports on the design, implementation, and empirical results of a new method for dealing with the aliasing problem in C. The method is based on approximating the points-to relationships between accessible stack locations, and can be used to generate alias pairs, or used directly for other analyses and transformations.
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
Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects
Choi, J.-D., Burke, M., & Carini, P. R. (1993) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/158511.158639 · Cited by 362
Constructing the Call Graph of a Program
Ryder, B. G. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234183 · Cited by 302
Control flow analysis in scheme
Shivers, O. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54007 · Cited by 282
A safe approximate algorithm for interprocedural pointer aliasing
Landi, W. A., & Ryder, B. G. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989440 · Cited by 276
Control flow analysis in scheme
Shivers, O. (1988) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/53990.54007 · Cited by 234
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
Self-citationJones, 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
The interprocedural analysis and automatic parallelization of Scheme programs
Harrison, W. L. (1989) · LISP and Symbolic Computation · doi:10.1007/bf01808954 · Cited by 134
Cited by
Points-to analysis in almost linear time
Steensgaard, B. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237727 · Cited by 1,088
Intrusion detection via static analysis
Wagner, D., & Dean, R. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924296 · Cited by 647
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
Whaley, J., & Lam, M. S. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996859 · Cited by 582
Locating features in source code
Eisenbarth, T., Koschke, R., & Simon, D. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1183929 · Cited by 554
Efficient 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
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
Scaling Java Points-to Analysis Using Spark
Lhoták, O., & Hendren, L. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36579-6_12 · Cited by 427
Self-citationInterprocedural slicing using dependence graphs
Horwitz, S., Reps, T., & Binkley, D. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989419 · Cited by 372
A brief survey of program slicing
Xu, B., Qian, J., Zhang, X., Wu, Z., & Chen, L. (2005) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1050849.1050865 · Cited by 313
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-citationObservational determinism for concurrent program security
Zdancewic, S., & Myers, A. C. (2004) · 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings. · doi:10.1109/csfw.2003.1212703 · Cited by 270
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
“The algorithm uses location sets to represent the memory locations accessed by statements that dereference pointers and caches the results of previous analyses to avoid performance problems caused by repeatedly analyzing the same procedure in the same context [21, 6].”
MethodAutomatic Parallelization of Recursive Procedures
Gupta, M., Mukhopadhyay, S., & Sinha, N. (2000) · International Journal of Parallel Programming · doi:10.1023/a:1007560600904 · Cited by 44
Metadata
- Authors
- Emami, M., Ghiya, R., & Hendren, L. J.
- Venue
- Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 1994-06
- Pages
- 242-256
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2151360539
- Cited by
- 570
- References
- 14
- FWCI
- 26.23
- 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
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.