An Epistemic Perspective on Consistency of Concurrent Computations
Logic in Computer Science
2013-05-13 v1
Abstract
Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such consistency properties that is based on a standard logic of knowledge. Our formalization provides a declarative perspective on what is imposed by consistency requirements and provides some interesting unifying insight on differently looking properties.
Cite
@article{arxiv.1305.2295,
title = {An Epistemic Perspective on Consistency of Concurrent Computations},
author = {Klaus v. Gleissenthall and Andrey Rybalchenko},
journal= {arXiv preprint arXiv:1305.2295},
year = {2013}
}