IBM Systems Journal · 2002 · 208 citations · 14 references
ComputingComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsConcurrency AnalysisConcurrent ProgrammingSoftware Fault ToleranceSoftware TestingSynchronization PrimitivesConcurrency Bug DebuggingConcurrency Bug DetectionConcurrency Bug LocalizationConcurrent Program TestingExecution Trace AnalysisReplayShared MemorySynchronization
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.
14
Stefan Savage, Michael T. Burrows, Greg Nelson et al. · ACM Transactions on Computer Systems · 1997 · 1.6K citations · Full text
Deterministic replay of Java multithreaded applications
Jong-Deok Choi, Harini Srinivasan · 1998 · 264 citations · Full text