The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Escape analysis for object-oriented languages: application to Java
Abstract
Escape analysis [27, 14, 5] is a static analysis that determines whether the lifetime of data exceeds its static scope.
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
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
Systematic design of program analysis frameworks
Cousot, P., & Cousot, R. (1979) · Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79 · doi:10.1145/567752.567778 · Cited by 1,621
Choi, J.-D., Gupta, M., Serrano, M. J., Sreedhar, V. C., & Midkiff, S. P. (1999) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/320384.320386 · Cited by 506
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
Compiler optimizations for improving data locality
Carr, S., McKinley, K. S., & Tseng, C.-W. (1994) · Proceedings of the sixth international conference on Architectural support for programming languages and operating systems · doi:10.1145/195473.195557 · Cited by 291
Control flow analysis in scheme
Shivers, O. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54007 · Cited by 282
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
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
Removing unnecessary synchronization in Java
Bogda, J., & Hölzle, U. (1999) · Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/320384.320388 · Cited by 210
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
From region inference to von Neumann machines via region representation inference
Birkedal, L., Tofte, M., & Vejlstrup, M. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237771 · Cited by 139
Better static memory management: improving region-based analysis of higher-order languages
Aiken, A., Fähndrich, M. A., & Levien, R. (1995) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/207110.207137 · Cited by 135
The interprocedural analysis and automatic parallelization of Scheme programs
Harrison, W. L. (1989) · LISP and Symbolic Computation · doi:10.1007/bf01808954 · Cited by 134
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
Aldrich, J., Chambers, C., Sirer, E. G., & Eggers, S. J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48294-6_2 · Cited by 115
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
Deutsch, A. (1990) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/96709.96725 · Cited by 107
Escape analysis: correctness proof, implementation and experimental results
Blanchet, B. (1998) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/268946.268949 · Cited by 83
Self-citationOn the complexity of escape analysis
Deutsch, A. (1997) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/263699.263750 · Cited by 59
Storage use analysis and its applications
Serrano, M. V., & Feeley, M. (1996) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/232627.232635 · Cited by 45
Cited by
Type-based race detection for Java
Flanagan, C., & Freund, S. N. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349328 · Cited by 446
Efficient and precise datarace detection for multithreaded object-oriented programs
Choi, J.-D., Lee, K., Loginov, A., O'Callahan, R., Sarkar, V., & Sridharan, M. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512560 · Cited by 441
A parameterized type system for race-free Java programs
Boyapati, C., & Rinard, M. (2001) · Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/504282.504287 · Cited by 296
Ownership, encapsulation and the disjointness of type and effect
Clarke, D., & Drossopoulou, S. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582447 · Cited by 257
Welc, A., Jagannathan, S., & Hosking, A. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094845 · Cited by 181
Metadata
- Authors
- Blanchet, B.
- Venue
- Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
- Publisher
- ACM
- Published
- 1999-10
- Pages
- 20-34
- OpenAlex
- W2036719919
- Cited by
- 294
- References
- 19
- FWCI
- 25.75
- 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.