Fences in weak memory models (extended version) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Formal Methods in System Design Year : 2012

Fences in weak memory models (extended version)


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.
Fichier principal
Vignette du fichier
fences-fmsd12.pdf (421.15 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01100778 , version 1 (07-01-2015)



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



Gmail Mastodon Facebook X LinkedIn More