11 search results - page 2 / 3 » Formalising Java's Data Race Free Guarantee |
PLDI
2011
ACM
12 years 8 months ago
2011
ACM
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...
PLDI
2010
ACM
13 years 7 months ago
2010
ACM
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
FMOODS
2008
13 years 6 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...
SOSP
2009
ACM
14 years 2 months ago
2009
ACM
Reproducing bugs is hard. Deterministic replay systems address this problem by providing a high-fidelity replica of an original program run that can be repeatedly executed to zer...
PPOPP
2011
ACM
12 years 8 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...