• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Eraser: a dynamic data race detector for multithreaded programs (1997)

Cached

  • Download as a PDF

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]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Stefan Savage , Michael Burrows , Greg Nelson , Patrick Sobalvarro , Thomas Anderson
Venue:ACM Transaction of Computer System
Citations:478 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

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

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

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

Citations

2115 Clocks and the Ordering of Events in a Distributed System - Lamport - 1978
691 ATOM: A System for Building Customized Program Analys is Tools - Srivastava, Eustace - 1994
446 Monitors - An Operating System Structuring Concept - Hoare - 1974
392 safety and performance in the SPIN operating system - BERSHAD, SAVAGE, et al. - 1995
299 Thekkath. Petal: Distributed virtual disks - Lee, A - 1996
273 Extended static checking - Detlefs, Leino, et al. - 1998
207 Thekkath. Shasta: A Low-Overhead Software-Only Approach to Fine-Grain Shared Memory - Scales, Gharachorloo, et al. - 1996
138 Experiences with Processes and Monitors in Mesa - Lampson, Redell - 1980
103 An empirical comparison of monitoring algorithms for access anomaly detection - Dinning, Schonberg - 1990
97 Why Threads Are A Bad Idea (for most purposes - Ousterhout - 1995
79 Detecting access anomalies in programs with critical sections - Dinning, Schonberg - 1991
70 On-the-fly detection of data races for programs with nested fork-join parallelism - Mellor-Crummey - 1991
43 Online data-race detection via coherency guarantees - Perkovic, Keleher - 1996
27 Compile-time support for efficient data race detection in shared memory parallel programs - Mellor-Crummey - 1992
26 Race Condition Detection for Debugging Shared-Memory Parallel Programs - Netzer - 1991
22 Trestle reference manual - Manasse, Nelson - 1991
19 Interrupts as threads - Kleiman, Eykholt - 1995
5 lint User’s Guide - lock - 1994
1 1997. A Dynamic Data Race Detector for Multithread Programs • 411 - LAMPSON, REDELL
1 Trestle reference manual. Res - MANASSE, NELSON - 1991
1 lock lint user’s guide - SUNSOFT - 1994
1 Extended Static Checking Home - Nelson, Leino, et al. - 1996
1 Shasta: A Low Overhead - Scales, Gharachorloo, et al.
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University