Detecting Data Races by Analyzing Sequential Traces

Front Cover
University of California, Santa Cruz, Computer Research Laboratory, 1990 - Debugging in computer science - 29 pages
0 Reviews
In general, it is not possible to determine which of the consistent executions occurred. Therefore we introduce the notion of 'safe orderings' between events which are guaranteed to hold in every execution which is consistent with the trace. The main result of the paper is a series of algorithms which determine many of the 'safe orderings'. An algorithm is also presented to distinguish unordered sequential events from concurrent events. A working trace analyzer has been implemented. The trace analyzer can report various data races in parallel programs by finding unordered pairs of events and variable access conflicts."

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Common terms and phrases

Bibliographic information