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. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Von Gleissenthall, K., & Rybalchenko, A. (2013). An epistemic perspective on consistency of concurrent computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8052 LNCS, pp. 212–226). https://doi.org/10.1007/978-3-642-40184-8_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
