Affiliation:
1. MPI-SWS, Germany
2. Imperial College London, UK
Abstract
There is an increasing body of literature proposing new and efficient
persistent versions of concurrent data structures ensuring that a consistent
state can be recovered after a power failure or a crash.
Their correctness is typically stated in terms of
durable linearizability
(DL),
which requires that individual library operations appear to be executed
atomically in a sequence consistent with the real-time order and, moreover,
that recovering from a crash return a state corresponding to a prefix of that
sequence.
Sadly, however, there are hardly any formal DL proofs, and those that do exist
cover the correctness of rather simple persistent algorithms on specific
(simplified) persistency models.
In response, we propose a general, powerful, modular, and incremental proof technique that
can be used to guide the development and establish DL.
Our technique is
(1)
general
, in that it is not tied to a specific persistency and/or consistency model,
(2)
powerful
, in that it can handle the most advanced persistent algorithms in the literature,
(3)
modular
, in that it allows the reuse of an existing linearizability argument, and
(4)
incremental
, in that the additional requirements for establishing DL
depend on the complexity of the algorithm to be verified.
We illustrate this technique on various versions of a persistent set,
leading to the link-free set of Zuriel et al.
Funder
European Research Council
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference32 articles.
1. Marcos K. Aguilera and Svend Frolund . 2003 . Strict Linearizability and the Power of Aborting . https://www.hpl.hp.com/ techreports/2003/HPL-2003-241.html Marcos K. Aguilera and Svend Frolund. 2003. Strict Linearizability and the Power of Aborting. https://www.hpl.hp.com/ techreports/2003/HPL-2003-241.html
2. A formal hierarchy of weak memory models
3. Library abstraction for C/C++ concurrency
4. Mathematizing C++ concurrency
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献