Eraser: a dynamic data race detector for multithreaded programs
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Multithreaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This article describes a new tool, called Eraser, for dynamically detecting data races in lock-based multithreaded programs. Eraser uses binary rewriting techniques to monitor every shared-monory reference and verify that consistent locking behavior is observed. We present several case studies, including undergraduate coursework and a multithreaded Web search engine, that demonstrate the effectiveness of this approach.
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
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
Monitors: an operating system structuring concept
Hoare, C. A. R. (1974) · Communications of the ACM · doi:10.1145/355620.361161 · Cited by 1,496
ATOM: a system for building customized program analysis tools
Srivastava, A., & Eustace, A. (1994) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/178243.178260 · Cited by 981
Extensibility safety and performance in the SPIN operating system
Bershad, B. N., Savage, S., Pardyak, P., Sirer, E. G., Fiuczynski, M. E., Becker, D., Chambers, C., & Eggers, S. (1995) · Proceedings of the fifteenth ACM symposium on Operating systems principles - SOSP '95 · doi:10.1145/224056.224077 · Cited by 955
Self-citationLeino, K. R. M. (1998) · Programming Concepts and Methods PROCOMET ’98 · doi:10.1007/978-0-387-35358-6_1 · Cited by 393
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
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
An 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
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
Cited by
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
Visser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
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
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics
Lu, S., Park, S., Seo, E., & Zhou, Y. (2008) · Proceedings of the 13th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1346281.1346323 · Cited by 895
Hovemeyer, D., & Pugh, W. (2004) · Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications · doi:10.1145/1028664.1028717 · Cited by 760
Bugs as deviant behavior: a general approach to inferring errors in systems code
Engler, D., Chen, D. Y., Hallem, S., Chou, A., & Chelf, B. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502041 · Cited by 737
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
CP-Miner: finding copy-paste and related bugs in large-scale software code
Li, Z., Lu, S., Myagmar, S., & Zhou, Y. (2006) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2006.28 · Cited by 610
Tracking down software bugs using automatic anomaly detection
Hangal, S., & Lam, M. S. (2002) · Proceedings/Proceedings - International Conference on Software Engineering · doi:10.1145/581339.581377 · Cited by 602
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
Checking system rules using system-specific, programmer-written compiler extensions
Engler, D., Chelf, B., Chou, A., & Hallem, S. (2000) · doi:10.5555/1251229.1251230 · Cited by 535
S2E: a platform for in-vivo multi-path analysis of software systems
Chipounov, V., Kuznetsov, V., & Candea, G. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950396 · Cited by 514
Iterative context bounding for systematic testing of multithreaded programs
Musuvathi, M., & Qadeer, S. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250785 · Cited by 483
ThreadSanitizer: data race detection in practice
Serebryany, K., & Iskhodzhanov, T. (2009) · Proceedings of the Workshop on Binary Instrumentation and Applications · doi:10.1145/1791194.1791203 · Cited by 451
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
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
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
Effective static race detection for Java
Naik, M., Aiken, A., & Whaley, J. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134018 · Cited by 408
Hovemeyer, D., & Pugh, W. (2004) · ACM SIGPLAN Notices · doi:10.1145/1052883.1052895 · Cited by 397
A "flight data recorder" for enabling full-system multiprocessor deterministic replay
Xu, M., Bodik, R., & Hill, M. D. (2003) · Proceedings of the 30th annual international symposium on Computer architecture - ISCA '03 · doi:10.1145/859618.859633 · Cited by 395
Leino, K. R. M. (1998) · Programming Concepts and Methods PROCOMET ’98 · doi:10.1007/978-0-387-35358-6_1 · Cited by 393
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
Visser, W., Havelund, K., Brat, G., & Park, S. (2000) · Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering · doi:10.1109/ase.2000.873645 · Cited by 341
CTrigger: exposing atomicity violation bugs from their hiding places
Park, S., Lu, S., & Zhou, Y. (2009) · Proceedings of the 14th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1508244.1508249 · Cited by 339
DynaMine: finding common error patterns by mining software revision histories
Livshits, B., & Zimmermann, T. (2005) · Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1081706.1081754 · Cited by 330
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
PRES: probabilistic replay with execution sketching on multiprocessors
Park, S., Zhou, Y., Xiong, W., Yin, Z., Kaushik, R., Lee, K. H., & Lu, S. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629593 · Cited by 303
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
From symptom to cause: localizing errors in counterexample traces
Ball, T., Naik, M., & Rajamani, S. K. (2003) · Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/604131.604140 · Cited by 294
BugNet: Continuously Recording Program Execution for Deterministic Replay Debugging
Narayanasamy, S., Pokam, G., & Calder, B. (2005) · ACM SIGARCH Computer Architecture News · doi:10.1145/1080695.1069994 · Cited by 278
/*icomment: bugs or bad comments?*/
Tan, L., Yuan, D., Krishna, G., & Zhou, Y. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294276 · Cited by 268
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
Mining Temporal Specifications for Error Detection
Weimer, W., & Necula, G. C. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31980-1_30 · Cited by 253
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
(2008) · Cited by 47
Metadata
- Authors
- Savage, S., Burrows, M., Nelson, G., Sobalvarro, P., & Anderson, T.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1997-11
- Volume
- 15
- Issue
- 4
- Pages
- 391-411
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W1972544179
- Cited by
- 1,572
- References
- 9
- FWCI
- 56.35
- 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.