%0 Conference Proceedings
%T An Observational Approach to Defining Linearizability on Weak Memory Models
%+ University of Sheffield [Sheffield]
%+ The University of Queensland (UQ [All campuses : Brisbane, Dutton Park Gatton, Herston, St Lucia and other locations])
%A Derrick, John
%A Smith, Graeme
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Neuchâtel, Switzerland
%Y Ahmed Bouajjani
%Y Alexandra Silva
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-10321
%P 108-123
%8 2017-06-19
%D 2017
%R 10.1007/978-3-319-60225-7_8
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01658421/document
%2 https://inria.hal.science/hal-01658421/file/446833_1_En_8_Chapter.pdf
%L hal-01658421
%U https://inria.hal.science/hal-01658421
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-10321