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
Unit testing for multi-threaded Java programs
Gábor Szeder
- 19 Jul 2009
TL;DR: This paper presents a unitTesting framework for detecting concurrency bugs in multi-threaded Java programs based on the JUnit unit testing framework and the Java PathFinder software model checker.
Race directed random testing of concurrent programs
Koushik Sen
- 07 Jun 2008
TL;DR: A novel randomized dynamic analysis technique that utilizes potential data race information obtained from an existing analysis tool to separate real races from false races without any need for manual inspection is proposed.
Asserting and checking determinism for multithreaded programs
Jacob Burnim,Koushik Sen +1 more
- 24 Aug 2009
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.
Active sampling for multiple output identification
Shai Fine,Yishay Mansour +1 more
- 22 Jun 2006
TL;DR: Efficient active sampling algorithms for simple geometric concepts, such as intervals on a line and axis parallel boxes, and an analysis of active sampling with uniform distribution in the plane are found.
Testing concurrent programs on relaxed memory models
Jacob Burnim,Koushik Sen,Christos Stergiou +2 more
- 17 Jul 2011
TL;DR: Relaxer, a combination of predictive dynamic analysis and software testing, to help programmers write correct, highly-concurrent programs and generates many executions of these benchmarks with violations of sequential consistency, highlighting a number of bugs under relaxed memory models.
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