Journal ArticleOPEN ACCESS

Detecting data races in sequential programs with DIOTA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3149 82-89
DOI: 10.1007/978-3-540-27866-5_11
10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we show that data races, a type of bug that generally only causes havoc in parallel programs, can also occur in sequential programs that use signal handlers. Fortunately, it turns out that adapting existing data race detectors to detect such bugs for sequential programs is straightforward. We present such a tool, and we describe the modifications that were necessary to detect data races in sequential programs. The experimental evaluation revealed a number of data races in some widely used programs. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Ronsse, M., Maebe, J., & De Bosschere, K. (2004). Detecting data races in sequential programs with DIOTA. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 82–89. https://doi.org/10.1007/978-3-540-27866-5_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free