Proceedings Article10.1145/376656.376848
Multithreaded Java program test generation
Orit Edelstein,Eitan Farchi,Yarden Nir,Gil Ratsaby,Shmuel Ur +4 more
- 01 Jun 2001
- pp 181
TL;DR: ConTest, a tool for detecting synchronization faults in multithreaded Java programs that makes random or coveragebased decisions as to whether the seeded primitive is to be executed, increases the probability of finding concurrent faults.
read more
Abstract: We describe ConTest, a tool for detecting synchronization faults in multithreaded Java™ programs. The program under test is seeded with a sleep(), yield(), or priority() primitive at shared memory accesses and synchronization events. At run time, ConTest makes random or coverage-based decisions as to whether the seeded primitive is to be executed. Thus, the probability of finding concurrent faults is increased. A replay algorithm facilitates debugging by saving the order of shared memory accesses and synchronization events.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
UNICORN: a unified approach for localizing non-deadlock concurrency bugs
TL;DR: The evaluation shows that UNICORN can effectively compute and rank the patterns that represent concurrency bugs, and perform computation and ranking with reasonable efficiency.
44
Probabilistic regression suites for functional verification
Shai Fine,Shmuel Ur,Avi Ziv +2 more
- 07 Jun 2004
TL;DR: Experimental results show that this practical technique can be used to improve the quality, and reduce the cost, of regression suites and enables better informed decisions regarding the size and distribution of the regression suites, and the risk involved.
43
Source-Code Instrumentation and Quantification of Events
Robert E. Filman,Klaus Havelund,Daniel Clancy +2 more
- 01 Jan 2002
TL;DR: It is argued that all quantification is over dynamic events, and preliminary work in developing a system that maps dynamic events to transformations over source code is described.
Efficient concurrency-bug detection across inputs
Dongdong Deng,Wei Zhang,Shan Lu +2 more
- 29 Oct 2013
TL;DR: This paper uses open-source software to study how existing concurrency-bug detection tools work for a set of inputs, and proposes a coverage metric, Concurrent Function Pairs (CFP), to efficiently approximate how interleavings overlap across inputs.
On-the-fly race detection in multi-threaded programs
Ali Jannesari,Walter F. Tichy +1 more
- 20 Jul 2008
TL;DR: An extended race detection technique based on a combination of lockset analysis and the happens-before relation is described, which provides more accurate warnings and significantly reduces the number of false positives, while limiting thenumber of false negatives.
39
References
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.
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.
•Book
Design and validation of computer protocols
Gerard J. Holzmann
- 01 Jan 1991
TL;DR: Part 1 Basic: introduction protocol structure error control flow control and design tools: a protocol simulator a protocol validator using the validator.
Eraser: a dynamic data race detector for multithreaded programs
TL;DR: A new tool, called Eraser, is described, for dynamically detecting data races in lock-based multithreaded programs, which uses binary rewriting techniques to monitor every shared-monory reference and verify that consistent locking behavior is observed.
A general-purpose algorithm for analyzing concurrent programs
TL;DR: A static analysis algorithm is presented here that addresses the following problems: how processes are synchronized, what determines when programs are run in parallel, and how errors are detected in the synchronization structure.
322