Proceedings ArticleDOI
Eraser: a dynamic data race detector for multi-threaded programs
Stefan Savage,Michael Burrows,Greg Nelson,Patrick G. Sobalvarro,Thomas Anderson +4 more
- Vol. 31, Iss: 5, pp 27-37
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
Journal ArticleDOI
Reachability testing of concurrent programs
Yu Lei,Richard H. Carver +1 more
TL;DR: A general execution model for concurrent programs that allows reachability testing to be applied to several commonly used synchronization constructs is presented and a new method for performing reachable testing is presented.
Proceedings ArticleDOI
Proving correctness of highly-concurrent linearisable objects
TL;DR: These examples are demonstrative of common design patterns such as lock coupling, optimistic, and lazy synchronisation, and it is proved that they are linearisable, safe, and they correctly implement a high-level abstraction.
Proceedings ArticleDOI
The theory of deadlock avoidance via discrete control
TL;DR: This paper presents a theoretical foundation for dynamic deadlock avoidance in concurrent programs that employ conventional mutual exclusion and synchronization primitives and guarantees that the control logic is maximally permissive, and therefore permits maximal runtime concurrency.
Proceedings ArticleDOI
TaxDC: A Taxonomy of Non-Deterministic Concurrency Bugs in Datacenter Distributed Systems
TL;DR: This work studies 104 distributed concurrency bugs from four widely-deployed cloud-scale datacenter distributed systems, Cassandra, Hadoop MapReduce, HBase and ZooKeeper to present TaxDC, the largest and most comprehensive taxonomy of non-deterministic concurrence bugs in distributed systems.
Book ChapterDOI
Verify Your Runs
Klaus Havelund,Allen Goldberg +1 more
TL;DR: In this paper it is argued that regular economic use of program verification of arbitrary properties to be fully achieved within the 15 year time horizon of the challenge is not expected.
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
Brian N. Bershad,Stefan Savage,Przemysław Pardyak,Emin Gün Sirer,Marc E. Fiuczynski,David Becker,Craig Chambers,Susan J. Eggers +7 more
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
Amitabh Srivastava,Alan Eustace +1 more
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.