Effective static race detection for Java
Open accessThe DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Abstract
We present a novel technique for static race detection in Java programs, comprised of a series of stages that employ a combination of static analyses to successively reduce the pairs of memory accesses potentially involved in a race. We have implemented our technique and applied it to a suite of multi-threaded Java programs. Our experiments show that it is precise, scalable, and useful, reporting tens to hundreds of serious and previously unknown concurrency bugs in large, widely-used programs with few false alarms.
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
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
The nesC language: a holistic approach to networked embedded systems
Gay, D., Levis, P., von Behren, R., Welsh, M., Brewer, E., & Culler, D. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641652 · Cited by 1,631
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
Manson, J., Pugh, W., & Adve, S. V. (2005) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1040305.1040336 · Cited by 775
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
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
Whaley, J., & Lam, M. S. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996859 · Cited by 582
Self-citationOwnership 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
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
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
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
RacerX: 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
von Praun, C., & Gross, T. R. (2001) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/504282.504288 · Cited by 353
RaceTrack: efficient detection of data race conditions via adaptive tracking
Yu, Y., Rodeheffer, T., & Chen, W. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095832 · Cited by 318
RecPlay: a fully integrated practical record/replay system
Ronsse, M., & De Bosschere, K. (1999) · ACM Transactions on Computer Systems · doi:10.1145/312203.312214 · Cited by 315
A type and effect system for atomicity
Flanagan, C., & Qadeer, S. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781169 · Cited by 304
KISS: 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
RaceTrack: efficient detection of data race conditions via adaptive tracking
Yu, Y., Rodeheffer, T., & Chen, W. (2005) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1095810.1095832 · Cited by 271
A type and effect system for atomicity
Flanagan, C., & Qadeer, S. (2003) · Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation · doi:10.1145/781131.781169 · Cited by 241
Eraser: a dynamic data race detector for multi-threaded programs
Savage, S., Burrows, M. T., Nelson, G., Sobalvarro, P. G., & Anderson, T. E. (1997) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/268998.266641 · Cited by 237
On-the-fly detection of data races for programs with nested fork-join parallelism
Mellor-Crummey, J. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125861 · Cited by 229
Efficient on-the-fly data race detection in multithreaded C++ programs
Pozniansky, E., & Schuster, A. (2003) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/781498.781529 · Cited by 206
Detecting access anomalies in programs with critical sections
Dinning, A., & Schonberg, E. (1991) · Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging · doi:10.1145/122759.122767 · Cited by 190
Context-sensitive program analysis as database queries
Lam, M. S., Whaley, J., Livshits, V. B., Martin, M. C., Avots, D., Carbin, M., & Unkel, C. (2005) · Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1065167.1065169 · Cited by 172
Self-citationAn empirical comparison of monitoring algorithms for access anomaly detection
Dinning, A., & Schonberg, E. (1990) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/99163.99165 · Cited by 165
Techniques for debugging parallel programs with flowback analysis
Choi, J.-D., Miller, B. P., & Netzer, R. H. B. (1991) · ACM Transactions on Programming Languages and Systems · doi:10.1145/115372.115324 · Cited by 164
An empirical comparison of monitoring algorithms for access anomaly detection
Dinning, A., & Schonberg, E. (1990) · ACM SIGPLAN Notices · doi:10.1145/99164.99165 · Cited by 164
Detecting data races in Cilk programs that use locks
Cheng, G.-I., Feng, M. D., Leiserson, C. E., Randall, K. H., & Stark, A. F. (1998) · ACM Symposium on Parallel Algorithms and Architectures (SPAA) · doi:10.1145/277651.277696 · Cited by 148
Demand-driven alias analysis for C
Zheng, X., & Rugina, R. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328464 · Cited by 143
Static conflict analysis for multi-threaded object-oriented programs
von Praun, C., & Gross, T. R. (2003) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/781131.781145 · Cited by 135
Static conflict analysis for multi-threaded object-oriented programs
von Praun, C., & Gross, T. R. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781145 · Cited by 134
Efficient on-the-fly data race detection in multithreaded C++ programs
Pozniansky, E., & Schuster, A. (2004) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2003.1213513 · Cited by 127
Flanagan, C., & Qadeer, S. (2003) · Types In Languages Design And Implementation · doi:10.1145/604174.604176 · Cited by 126
Detecting race conditions in large programs
Cormac Flanagan, A., & Freund, S. N. (2001) · ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE) · doi:10.1145/379605.379687 · Cited by 94
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
Type Inference for Parameterized Race-Free Java
Agarwal, R., & Stoller, S. D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24622-0_14 · Cited by 69
Verifying Commit-Atomicity Using Model-Checking
Cormac Flanagan, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24732-6_18 · Cited by 57
Context-sensitive pointer analysis using binary decision diagrams
Lam, M. S., & Whaley, J. (2007) · Cited by 27
Self-citation
Cited by
A Survey on Software Fault Localization
Wong, W. E., Gao, R., Li, Y., Abreu, R., & Wotawa, F. (2016) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2016.2521368 · Cited by 1,110
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
(2008) · Cited by 47
Active Inductive Logic Programming for Code Search
Sivaraman, A., Zhang, T., Van den Broeck, G., & Kim, M. (2019) · 2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2019.00044 · Cited by 34
Metadata
- Authors
- Naik, M., Aiken, A., & Whaley, J.
- Venue
- ACM SIGPLAN Notices
- Published
- 2006-06-11
- Volume
- 41
- Issue
- 6
- Pages
- 308-319
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2133662847
- Cited by
- 408
- References
- 40
- FWCI
- 79.29
- Type
- journal article
- Language
- en
- Open access
- bronze
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.