Sciweavers

96 search results - page 7 / 20
» Detecting Data Races in Sequential Programs with DIOTA
Sort
View
ATVA
2004
Springer
135views Hardware» more  ATVA 2004»
14 years 1 months ago
Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors
Data races do not cover all kinds of concurrency errors. This paper presents a data-ow-based technique to nd stale-value errors, which are not found by low-level and high-level d...
Cyrille Artho, Klaus Havelund, Armin Biere
OOPSLA
2004
Springer
14 years 1 months ago
Efficient data race and deadlock prevention in concurrent object-oriented programs
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...
Piotr Nienaltowski
PPOPP
2009
ACM
14 years 8 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
TPHOL
2007
IEEE
14 years 2 months ago
Formalising Java's Data Race Free Guarantee
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...
David Aspinall, Jaroslav Sevcík
PLDI
2011
ACM
12 years 10 months ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík