S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
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.
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Leo Liberti, James Ostrowski
Journal of Global Optimization