The DOI matches its Crossref record.
Efficient context-sensitive pointer analysis for C programs
Abstract
This paper proposes an efficient technique for context-sensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using partial transfer functions . A partial transfer function (PTF) describes the behavior of a procedure assuming that certain alias relationships hold when it is called. We can reuse a PTF in many calling contexts as long as the aliases among the inputs to the procedure are the same. Our empirical results demonstrate that this technique is successful—a single PTF per procedure is usually sufficient to obtain completely context-sensitive results. Because many C programs use features such as type casts and pointer arithmetic to circumvent the high-level type system, our algorithm is based on a low-level representation of memory locations that safely handles all the features of C. We have implemented our algorithm in the SUIF compiler system and we show that it runs efficiently for a set of C benchmarks.
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
A survey of mobile cloud computing: architecture, applications, and approaches
Dinh, H. T., Lee, C., Niyato, D., & Wang, P. (2013) · Wireless Communications and Mobile Computing · doi:10.1002/wcm.1203 · Cited by 2,391
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
ESP: path-sensitive program verification in polynomial time
Das, M., Lerner, S., & Seigle, M. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512538 · Cited by 552
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
Computation Offloading for Service Workflow in Mobile Cloud Computing
Deng, S., Huang, L., Taheri, J., & Zomaya, A. Y. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2381640 · Cited by 276
Metadata
- Authors
- Wilson, R. P., & Lam, M. S.
- Venue
- ACM SIGPLAN Notices
- Published
- 1995-06
- Volume
- 30
- Issue
- 6
- Pages
- 1-12
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2087612811
- Cited by
- 539
- References
- 0
- FWCI
- 28.25
- 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: Efficient context-sensitive pointer analysis for C programs. https://app.cochat.ai/papers/10.1145/223428.207111
- The paper
- Wilson, R. P., & Lam, M. S. (1995). Efficient context-sensitive pointer analysis for C programs. ACM SIGPLAN Notices. https://doi.org/10.1145/223428.207111
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.