Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 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.
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007