Verifying eventual consistency of optimistic replication systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We address the verification problem of eventual consistency of optimistic replication systems. Such systems are typically used to implement distributed data structures over large scale networks. We introduce a formal definition of eventual consistency that applies to a wide class of existing implementations, including the ones using speculative executions. Then, we reduce the problem of checking eventual consistency to reachability and model checking problems. This reduction enables the use of existing verification tools for message-passing programs in the context of verifying optimistic replication systems. Furthermore, we derive from these reductions decision procedures for checking eventual consistency of systems implemented as finite-state programs communicating through unbounded unordered channels.

Original languageEnglish
Title of host publicationPOPL 2014 - Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Pages285-296
Number of pages12
DOIs
Publication statusPublished - 11 Feb 2014
Externally publishedYes
Event41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014 - San Diego, CA, United States
Duration: 22 Jan 201424 Jan 2014

Publication series

NameConference Record of the Annual ACM Symposium on Principles of Programming Languages
ISSN (Print)0730-8566

Conference

Conference41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014
Country/TerritoryUnited States
CitySan Diego, CA
Period22/01/1424/01/14

Keywords

  • message passing concurrency
  • model checking
  • static program analysis

Fingerprint

Dive into the research topics of 'Verifying eventual consistency of optimistic replication systems'. Together they form a unique fingerprint.

Cite this