The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Type-based race detection for Java
Abstract
This paper presents a static race detection analysis for multithreaded Java programs. Our analysis is based on a formal type system that is capable of capturing many common synchronization patterns. These patterns include classes with internal synchronization, classes thatrequire client-side synchronization, and thread-local classes. Experience checking over 40,000 lines of Java code with the type system demonstrates that it is an effective approach for eliminating races conditions. On large examples, fewer than 20 additional type annotations per 1000 lines of code were required by the type checker, and we found a number of races in the standard Java libraries and other test programs.
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
The Java Language Specification
Gosling, J., Joy, B., & Steele, G. L. (1996) · Cited by 3,924
Eraser: a dynamic data race detector for multithreaded programs
Savage, S., Burrows, M., Nelson, G., Sobalvarro, P., & Anderson, T. (1997) · ACM Transactions on Computer Systems · doi:10.1145/265924.265927 · Cited by 1,572
Igarashi, A., Pierce, B. C., & Wadler, P. L. (2001) · ACM Transactions on Programming Languages and Systems · doi:10.1145/503502.503505 · Cited by 986
Region-Based Memory Management
Tofte, M., & Talpin, J.-P. (1997) · Information and Computation · doi:10.1006/inco.1996.2613 · Cited by 615
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
Flatt, M., Krishnamurthi, S., & Felleisen, M. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268961 · Cited by 487
Lucassen, J. M., & Gifford, D. K. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73564 · Cited by 481
Leino, K. R. M. (1998) · Programming Concepts and Methods PROCOMET ’98 · doi:10.1007/978-0-387-35358-6_1 · Cited by 393
Implementation of the typed call-by-value λ-calculus using a stack of regions
Tofte, M., & Talpin, J.-P. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.177855 · Cited by 337
Escape analysis for object-oriented languages: application to Java
Blanchet, B. (1999) · Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/320384.320387 · Cited by 294
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
Algebraic reconstruction of types and effects
Jouvelot, P., & Gifford, D. K. (1991) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/99583.99623 · Cited by 145
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
Escape analysis for object-oriented languages: application to Java
Blanchet, B. (1999) · ACM SIGPLAN Notices · doi:10.1145/320385.320387 · Cited by 103
Cited by
EXE: automatically generating inputs of death
Cadar, C., Ganesh, V., Pawlowski, P. M., Dill, D. L., & Engler, D. R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180445 · Cited by 788
Formalising Java’s Data Race Free Guarantee
Aspinall, D., & Ševčík, J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74591-4_4 · Cited by 754
RacerX: effective, static detection of race conditions and deadlocks
Engler, D., & Ashcraft, K. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945468 · Cited by 661
Ownership types for safe programming: preventing data races and deadlocks
Boyapati, C., Lee, R., & Rinard, M. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582440 · Cited by 570
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
Metadata
- Authors
- Flanagan, C., & Freund, S. N.
- Venue
- Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 2000-05
- Pages
- 219-232
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2109875364
- Cited by
- 446
- References
- 14
- FWCI
- 23.96
- 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.