A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande - JGI '01
We describe ConTest, a tool for detecting synchronization faults in multithreaded Java TM 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 coveragebased 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 accessesdoi:10.1145/376656.376848 fatcat:65w3bfoke5ftbe4gjigrg37mxy