283 search results - page 1 / 57 » Effective Program Verification for Relaxed Memory Models |
CAV
2008
Springer
13 years 6 months ago
2008
Springer
Program verification for relaxed memory models is hard. The high degree of nondeterminism in such models challenges standard verification techniques. This paper proposes a new veri...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
POPL
2009
ACM
14 years 5 months ago
2009
ACM
Multiprocessors are now dominant, but real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, t...
PLDI
2011
ACM
12 years 7 months ago
2011
ACM