22 search results - page 2 / 5 » Operational Reasoning for Concurrent Caml Programs and Weak ... |
POPL
2010
ACM
14 years 3 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...
CORR
2011
Springer
13 years 23 days 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 ...
PLDI
2010
ACM
13 years 8 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...
ESOP
2010
Springer
14 years 3 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
PLDI
2012
ACM
11 years 8 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...