Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-40184-8_16 | international conference on concurrency theory |
Keywords | DocType | Volume |
declarative perspective,standard logic,sequential consistency,correct concurrent algorithm,concurrent computation,consistency property,eventual consistency,logical formalization,interesting unifying insight,epistemic perspective,consistency requirement | Conference | abs/1305.2295 |
Citations | PageRank | References |
4 | 0.44 | 19 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus von Gleissenthall | 1 | 21 | 3.47 |
| Andrey Rybalchenko | 2 | 1439 | 68.53 |