Detecting and debugging data races is a complex task due to the large number of interleavings possible in a parallel program. Most tools can find the data races reliably in an observed execution, but they miss errors in alternative reorderings of events. In this paper we describe an automated approach to generate, from a single program trace, a model in CSP with alternative interleavings. We check for data races patterns and obtain a witness that allows the reproduction of errors. Reproduction reduces the developer effort to correct the error.
CITATION STYLE
Carril, L. M., & Tichy, W. F. (2015). Predicting and witnessing data races using CSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9058, pp. 400–407). Springer Verlag. https://doi.org/10.1007/978-3-319-17524-9_28
Mendeley helps you to discover research relevant for your work.