96 search results - page 10 / 20 » Detecting Data Races in Sequential Programs with DIOTA |
ISCA
2003
IEEE
14 years 1 months ago
2003
IEEE
While removing software bugs consumes vast amounts of human time, hardware support for debugging in modern computers remains rudimentary. Fortunately, we show that mechanisms for ...
ISCA
1998
IEEE
14 years 3 days ago
1998
IEEE
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
FMOODS
2008
13 years 9 months ago
2008
Reasoning about object-oriented programs is hard, due to , dynamic binding and the need for data abstraction and framing. Reasoning about concurrent object-oriented programs is eve...
PPOPP
2011
ACM
12 years 10 months ago
2011
ACM
Developing parallel software using current tools can be challenging. Even experts find it difficult to reason about the use of locks and often accidentally introduce race condit...