scispace - formally typeset
Proceedings ArticleDOI

Eraser: a dynamic data race detector for multi-threaded programs

Reads0
Chats0
TLDR
Eraser as mentioned in this paper uses binary rewriting techniques to monitor every shared memory reference and verify that consistent locking behavior is observed in lock-based multi-threaded programs, which can be used to detect data races.
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.

read more

Citations
More filters
Proceedings ArticleDOI

Efficient deterministic multithreading through schedule relaxation

TL;DR: P Peregrine is an efficient deterministic multithreading system that improves efficiency with two new techniques: determinism-preserving slicing to generalize a schedule to more inputs while preserving determinism, and schedule-guided simplification to precisely analyze a program according to a specific schedule.
Proceedings ArticleDOI

A study of interleaving coverage criteria

TL;DR: A concurrent program interleaving coverage criteria hierarchy is proposed, including seven (including five new) coverage criteria, all designed based on different concurrency fault models, whose cost ranges from exponential to linear.
Proceedings ArticleDOI

An effective dynamic analysis for detecting generalized deadlocks

TL;DR: A key advantage of this technique is that it discards most of the program logic which usually causes state-space explosion in model checking, and retains only the relevant synchronization logic in the trace program, which is sufficient for finding deadlocks.
Proceedings ArticleDOI

Asserting and checking determinism for multithreaded programs

TL;DR: This work proposes an assertion framework for specifying that regions of a parallel program behave deterministically despite non-deterministic thread interleaving, and allows programmers to write assertions involving pairs of program states arising from different parallel schedules.
Proceedings ArticleDOI

Fully automatic and precise detection of thread safety violations

TL;DR: This paper presents an automatic testing technique that reveals concurrency bugs in supposedly thread-safe classes, independent of hand-written tests and explicit specifications.
References
More filters
Book ChapterDOI

Time, clocks, and the ordering of events in a distributed system

TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI

Time, clocks, and the ordering of events in a distributed system

TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI

Monitors: an operating system structuring concept

TL;DR: In this paper, the authors develop Brinch-Hansen's concept of a monitor as a method of structuring an operating system and describe a possible method of implementation in terms of semaphores and give a suitable proof rule.
Proceedings ArticleDOI

Extensibility safety and performance in the SPIN operating system

TL;DR: This paper describes the motivation, architecture and performance of SPIN, an extensible operating system that provides an extension infrastructure together with a core set of extensible services that allow applications to safely change the operating system's interface and implementation.
Proceedings ArticleDOI

ATOM: a system for building customized program analysis tools

TL;DR: ATOM as mentioned in this paper is a single framework for building a wide range of customized program analysis tools, including block counting, profiling, dynamic memory recording, instruction and data cache simulation, pipeline simulation, evaluating branch prediction, and instruction scheduling.