64 search results - page 3 / 13 » Fences in Weak Memory Models |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
The memory consistency model is a fundamental system property characterizing a multiprocessor. The relative merits of strict versus relaxed memory models have been widely debated ...
POPL
2010
ACM
14 years 6 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
14 years 2 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
2006
Springer
14 years 8 days 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...
ICPP
2008
IEEE
14 years 3 months ago
2008
IEEE
—We address the recently recognized privatization problem in software transactional memory (STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristic...