abstract This paper presents a taxonomy that categorizes methods for determining event orders in executions of parallel programs. These event orderings can then be used to detect race conditions in parallel programs. The paper also shows how recent race results t into the event ordering taxonomy, and presents some new results for previously unexamined points in the taxonomy.
