arXiv · 2112.06233
A simple proof of three properties on Simpson's 4-slot Algorithm
Abstract
In this paper we present an invariance proof of three properties on Simpson's 4-slot algorithm, i.e. data-race freedom, data coherence and data freshness, which together implies linearisability of the algorithm. It is an extension of previous works whose proof focuses mostly on data-race freedom. In addition, our proof uses simply inductive invariants and transition invariants, whereas previous work uses more sophisticated machinery like separation logics, rely-guarantee or ownership transfer.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Xu Wang, Qiwen Xu. 2021-12-12. A simple proof of three properties on Simpson's 4-slot Algorithm. https://arxiv.org/abs/2112.06233
Cite the original work for its findings. Save a collection to share your selection of sources.