Thomas M. Cover
IEEE Trans. Inf. Theory
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.
Thomas M. Cover
IEEE Trans. Inf. Theory
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)