The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
Abstract
This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a method for every context of interest, and run a context-insensitive algorithm over the expanded call graph to get context-sensitive results. For precision, we generate a clone for every acyclic path through a program's call graph, treating methods in a strongly connected component as a single node. Normally, this formulation is hopelessly intractable as a call graph often has 10 acyclic paths or more. We show that these exponential relations can be computed efficiently using binary decision diagrams (BDDs). Key to the scalability of the technique is a context numbering scheme that exposes the commonalities across contexts. We applied our algorithm to the most popular applications available on Sourceforge, and found that the largest programs, with hundreds of thousands of Java bytecodes, can be analyzed in under 20 minutes. This paper shows that...
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
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
Java Virtual Machine Specification
Lindholm, T., & Yellin, F. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,155
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Precise interprocedural dataflow analysis via graph reachability
Reps, T., Horwitz, S., & Sagiv, M. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199462 · Cited by 1,170
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
Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis
Dean, J., Grove, D., & Chambers, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-49538-x_5 · Cited by 610
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
Choi, J.-D., Gupta, M., Serrano, M. J., Sreedhar, V. C., & Midkiff, S. P. (1999) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/320384.320386 · Cited by 549
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
Self-citationEfficient 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
Self-citationScaling 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
Bebop: A Symbolic Model Checker for Boolean Programs
Ball, T., & Rajamani, S. K. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722468_7 · Cited by 372
Horn clause queries and generalizations
Chandra, A. K., & Harel, D. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90002-0 · Cited by 309
Lhoták, O., & Hendren, L. J. (2004) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/996841.996861 · Cited by 76
Compactly Representing First-Order Structures for Static Analysis
Manevich, R., Ramalingam, G., Field, J., Goyal, D., & Sagiv, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45789-5_16 · Cited by 28
Cited by
Pixy: a static analysis tool for detecting Web application vulnerabilities
Jovanovic, N., Kruegel, C., & Kirda, E. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.29 · Cited by 722
The essence of command injection attacks in web applications
Su, Z., & Wassermann, G. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111070 · Cited by 515
Finding application errors and security flaws using PQL: a program query language
Martin, M., Livshits, B., & Lam, M. S. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094840 · Cited by 440
Self-citationEffective static race detection for Java
Naik, M., Aiken, A., & Whaley, J. (2006) · Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1133981.1134018 · Cited by 431
Self-citationJhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
Metadata
- Authors
- Whaley, J., & Lam, M. S.
- Venue
- Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 2004-06-09
- Pages
- 131-144
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2158600037
- Cited by
- 582
- References
- 16
- FWCI
- 32.09
- 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.