Concurrent specifications beyond linearizability

Abstract : With the advent of parallel architectures, distributed programs are used intensively and the question of how to formally specify the behaviors expected from such programs becomes crucial. A very general way to specify concurrent objects is to simply give the set of all the execution traces that we consider correct for the object. In many cases, one is only interested in studying a subclass of these concurrent specifications, and more convenient tools such as linearizability can be used to describe them. In this paper, what we call a concurrent specification will be a set of execution traces that moreover satisfies a number of axioms. As we argue, these are actually the only concurrent specifications of interest: we prove that, in a reasonable computational model, every program satisfies all of our axioms. Restricting to this class of concurrent specifications allows us to formally relate our concurrent specifications with the ones obtained by linearizability, as well as its more recent variants (set-and interval-linearizability).
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-02155500
Contributor : Samuel Mimram <>
Submitted on : Thursday, June 13, 2019 - 4:34:52 PM
Last modification on : Saturday, June 15, 2019 - 1:17:57 AM

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Données associées

Collections

Citation

Eric Goubault, Jérémy Ledent, Samuel Mimram. Concurrent specifications beyond linearizability. 22nd International Conference on Principles of Distributed Systems (OPODIS 2018), 2018, Hong Kong, China. ⟨10.4230/LIPIcs.OPODIS.2016.23⟩. ⟨hal-02155500⟩

Share

Metrics

Record views

15

Files downloads

4