Skip to Main content Skip to Navigation
Conference papers

An Observational Approach to Defining Linearizability on Weak Memory Models

Abstract : In this paper we present a framework for defining linearizability on weak memory models. The purpose of the framework is to be able to define the correctness of concurrent algorithms in a uniform way across a variety of memory models. To do so linearizability is defined within the framework in terms of memory order as opposed to program order. Such a generalisation of the original definition of linearizability enables it to be applied to non-sequentially consistent architectures. It also allows the definition to be given in terms of observable effects rather than being dependent on an understanding of the weak memory model architecture. We illustrate the framework on the TSO (Total Store Order) weak memory model, and show that it respects existing definitions of linearizability on TSO.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Thursday, December 7, 2017 - 3:49:00 PM
Last modification on : Wednesday, January 31, 2018 - 3:14:02 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



John Derrick, Graeme Smith. An Observational Approach to Defining Linearizability on Weak Memory Models. 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2017, Neuchâtel, Switzerland. pp.108-123, ⟨10.1007/978-3-319-60225-7_8⟩. ⟨hal-01658421⟩



Record views


Files downloads