What is a Race in a Program and when Can We Detect It?Computer Research Laboratory, University of California, Santa Cruz, 1993 - Debugging in computer science - 20 pages |
From inside the book
Results 1-1 of 1
Page 17
David Helmbold. would expect , ignoring the unlock - lock orderings results in many false anomalies . This is solved by adding lock covers to the labels for blocks in critical sections . A lock cover indicates what locks are held when a ...
David Helmbold. would expect , ignoring the unlock - lock orderings results in many false anomalies . This is solved by adding lock covers to the labels for blocks in critical sections . A lock cover indicates what locks are held when a ...
Common terms and phrases
3SAT accesses to shared algorithm analysis approach artifact race atomic operations branch conditions branch-free program Co-NP combinations of branches Computer conflicting statements contain a race contain synchronization containing semaphore synchronization control flow data race Definition detecting races e₁ and e2 e2 occur e2 overlap event ordering event pairs events are ordered events forming races exact solution execute concurrently exist executions fixed input free program infeasible races lock covers message passing Monotonically Synchronized mortem trace nesting depth Netzer Non-Monotonically Synchronized NP-hard Thm number of events on-the-fly ordered critical sections ordering relationships original program pairs of events partial order particular input polynomial possible input Post and Wait post Ct end post/wait no clear Post/Wait/Clear problem program/input pair race conditions race detection race statement races between events schedule shared memory parallel shared variable single semaphore statement instances synchronization constructs synchronization operations taxonomy Theorem type of synchronization unordered races updates XisT yes y/n y/n