Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
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.
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011