Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
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.
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Leo Liberti, James Ostrowski
Journal of Global Optimization
Zohar Feldman, Avishai Mandelbaum
WSC 2010