Eraser
Stefan Savage, Michael T. Burrows, Greg Nelson et al. · ACM Transactions on Computer Systems · 1997
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.
Cited by 1,572 works. doi:10.1145/265924.265927 Open-access PDF
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- Monitors
- Experience with processes and monitors in Mesa
- ATOM
- Extensibility safety and performance in the SPIN operating system
- Petal
- Extended static checking
- Shasta
- An empirical comparison of monitoring algorithms for access anomaly detection
- On-the-fly detection of data races for programs with nested fork-join parallelism