244 search results - page 2 / 49 » Generative Operational Semantics for Relaxed Memory Models |
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...
SPIN
2010
Springer
13 years 7 months ago
2010
Springer
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
ISOLA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Memory models of shared memory concurrent programs define the values a read of a shared memory location is allowed to see. Such memory models are typically weaker than t...
PODC
2010
ACM
14 years 13 days ago
2010
ACM
We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory bu...
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...