Fences in weak memory models (extended version)

Abstract : We present a class of relaxed memory models, defined in Coq, parame-terised by the chosen permitted local reorderings of reads and writes, and by the visibility of inter-and intra-processor communications through memory (e.g. store atomicity relaxation). We prove results on the required behaviour and placement of memory fences to restore a given model (such as Sequential Consistency) from a weaker one. Based on this class of models we develop a tool, diy, that system-atically and automatically generates and runs litmus tests. These tests can be used to explore the behaviour of processor implementations and the behaviour of models, and hence to compare the two against each other. We detail the results of experiments on Power and a model we base on them.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01100778
Contributor : Luc Maranget <>
Submitted on : Wednesday, January 7, 2015 - 9:48:16 AM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Wednesday, April 8, 2015 - 11:25:22 AM

File

fences-fmsd12.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jade Alglave, Luc Maranget, Susmit Sarkar, Peter Sewell. Fences in weak memory models (extended version). Formal Methods in System Design, Springer Verlag, 2012, 40 (2), pp.170 - 205. ⟨10.1007/s10703-011-0135-z⟩. ⟨hal-01100778⟩

Share

Metrics

Record views

512

Files downloads

195