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
Featherweight Java: a minimal core calculus for Java and GJ
Igarashi, A., Pierce, B. C., & Wadler, P. L. (2001) · ACM Transactions on Programming Languages and Systems · doi:10.1145/503502.503505 · Cited by 1,125
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) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/320384.320386 · Cited by 549
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
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
Hybrid dynamic data race detection
O'Callahan, R., & Choi, J.-D. (2003) · Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/781498.781528 · Cited by 432
Effective 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
Atomizer: a dynamic atomicity checker for multithreaded programs
Flanagan, C., & Freund, S. N. (2004) · Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/964001.964023 · Cited by 409
Self-citationEffective static race detection for Java
Naik, M., Aiken, A., & Whaley, J. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134018 · Cited by 408
Houdini, an Annotation Assistant for ESC/Java
Flanagan, C., & Leino, K. R. M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45251-6_29 · Cited by 405
Self-citationRacerX: effective, static detection of race conditions and deadlocks
Engler, D., & Ashcraft, K. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles · doi:10.1145/945445.945468 · Cited by 368
EXE: Automatically Generating Inputs of Death
Cadar, C., Ganesh, V., Pawlowski, P. M., Dill, D. L., & Engler, D. R. (2008) · ACM Transactions on Information and System Security · doi:10.1145/1455518.1455522 · Cited by 342
Using model checking to find serious file system errors
Yang, J., Twohey, P., Engler, D., & Musuvathi, M. (2006) · ACM Transactions on Computer Systems · doi:10.1145/1189256.1189259 · Cited by 310
A type and effect system for atomicity
Flanagan, C., & Qadeer, S. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781169 · Cited by 304
Self-citationKISS: keep it simple and sequential
Qadeer, S., & Wu, D. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996845 · Cited by 297
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
Automatically classifying benign and harmful data races using replay analysis
Narayanasamy, S., Wang, Z., Tigani, J., Edwards, A., & Calder, B. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250738 · Cited by 254
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
- 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.