A Taxonomy of Race Detection AlgorithmsComputer Research Laboratory, [University of California, Santa Cruz, 1994 - Computer algorithms - 18 pages |
Common terms and phrases
3SAT access anomalies ACM/ONR Workshop analyzing approach atomic operations branch conditions branch-free program C. E. McDowell combinations of branches Computer conflicting statements control flow D. P. Helmbold data race Definition detecting races Distributed Debugging e₁ and e2 events are ordered events e₁ events forming races exact solution exist executions fixed input Helmbold and C. E. lock covers Mellor-Crummey memory parallel program message passing Monotonically Synchronized nesting depth Non-Monotonically Synchronized nondeterminism nondeterministic number of events omission race on-the-fly ordered critical sections ordering relationships original program pairs of events Parallel and Distributed partial order polynomial Post and Wait post Xf Post/Wait no Clear Post/Wait/Clear problem Proc programs containing programs that contain R. H. B. Netzer race conditions race statement race yes Santa Cruz Schonberg shared variable SIGPLAN single semaphore statement instances static analysis synchronization constructs Theorem thread traced execution type of synchronization Unrestricted programs Workshop on Parallel XisF XisT yes y/n y/n