Relaxed memory models: an operational approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Relaxed memory models: an operational approach


Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to have in a given model. A minimal guarantee memory models should provide to the programmer is that well-synchronized, that is, data-race free code has a standard semantics. Traditionally, memory models are defined axiomatically, setting constraints on the order in which memory operations are allowed to occur, and the programming language semantics is implicit as determining some of these constraints. In this work we propose a new approach to formalizing a memory model in which the model itself is part of a weak operational semantics for a (possibly concurrent) programming language. We formalize in this way a model that allows write operations to the store to be buffered. This enables us to derive the ordering constraints from the weak semantics of programs, and to prove, at the programming language level, that the weak semantics implements the usual interleaving semantics for data-race free programs, hence in particular that it implements the usual semantics for sequential code.
Fichier principal
Vignette du fichier
gg-popl.pdf (214.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00420352 , version 1 (28-09-2009)


  • HAL Id : inria-00420352 , version 1


Gérard Boudol, Gustavo Petri. Relaxed memory models: an operational approach. POPL'09, Jan 2009, Savannah, GA,, United States. ⟨inria-00420352⟩
128 View
390 Download


Gmail Facebook X LinkedIn More