Computer Science Colloquium, 2002-2003

Yaniv Eytani
Department of Computer Science, University of Haifa
June 4, 2003

Heuristics for Finding Concurrent Bugs

This paper presents new heuristics that increase the probability of manifesting concurrent bugs. The heuristics are based on cross-run monitoring. A contended shared variable is chosen and random context switching is performed at accesses to that variable. The relative strength of the new heuristics is analyzed. In comparison to previous works, our heuristics increase the frequency of bug manifestation. In addition, the new heuristics were able to find bugs that previous methods did not discover.


Shuly Wintner
Last modified: Thu May 15 15:22:27 IDT 2003