317 search results - page 2 / 64 » Benchmarking weak memory models |
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...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
CAV
2010
Springer
13 years 8 months ago
2010
Springer
We present a class of relaxed memory models, defined in Coq, parameterised by the chosen permitted local reorderings of reads and writes, and the visibility of inter- and intra-pr...
WOMPAT
2001
Springer
13 years 9 months ago
2001
Springer
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
PLDI
2006
ACM
13 years 10 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...