Eraser: a dynamic data race detector for multithreaded programs (1997)
Cached
Download Links
- [www.news.cs.nyu.edu]
- [www-cse.ucsd.edu]
- [www.cs.washington.edu]
- [cs.unomaha.edu]
- [www.cs.purdue.edu]
- [www.cs.pdx.edu]
- [www.cs.purdue.edu]
- [cs.ucsb.edu]
- [www.cs.ucla.edu]
- [www.cs.duke.edu]
- [cs.ucsb.edu]
- [www.cs.ucsd.edu]
- [www.cis.udel.edu]
- [www.cs.washington.edu]
- [www-cse.ucsd.edu]
- [geyer.lcs.mit.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transaction of Computer System |
| Citations: | 478 - 2 self |
BibTeX
@ARTICLE{Savage97eraser:a,
author = {Stefan Savage and Michael Burrows and Greg Nelson and Patrick Sobalvarro and Thomas Anderson},
title = {Eraser: a dynamic data race detector for multithreaded programs},
journal = {ACM Transaction of Computer System},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Multi-threaded 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 paper describes a new tool, called Eraser, for dynamically detecting data races in lock-based multi-threaded programs. Eraser uses binary rewriting techniques to monitor every shared memory reference and verify that consistent locking behavior is observed. We present several case studies, including undergraduate coursework and a multi-threaded Web search engine, that demonstrate the effectiveness of this approach. 1
