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
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.