Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
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.
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Daniel M. Bikel, Vittorio Castelli
ACL 2008