Replicated data types: Specification, verification, optimality

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2014, Pages 271-284

  Burckhardt, Sebastian ^a   Gotsman, Alexey ^b   Yang, Hongseok ^c   Zawirski, Marek ^d  

^a MICROSOFT RESEARCH   (United States)

^b IMDEA SOFTWARE INSTITUTE   (Spain)

^c UNIVERSITY OF OXFORD   (United Kingdom)

^d UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

eventual consistency; replication; weak memory

Indexed keywords

CONSISTENCY PROTOCOL; CORRECTNESS PROOFS; EVENTUAL CONSISTENCY; GEOGRAPHICALLY DISTRIBUTED SYSTEMS; MULTIPLE OBJECTS; NOVEL TECHNIQUES; REPLICATION; WEAK MEMORY MODELS;

COMPUTER PROGRAMMING LANGUAGES; SPECIFICATIONS;

OPTIMIZATION;

EID: 84893500058     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2535838.2535848     Document Type: Conference Paper

References (37)

1. Riak key-value store. http://basho.com/products/riak-overview/.
2. S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. Computer, 29(12), 1996.
3. J. Alglave, D. Kroening, V. Nimal, and M. Tautschnig. Software verification for weak memory via program transformation. In ESOP, 2013.
4. M. Batty, M. Dodds, and A. Gotsman. Library abstraction for C/C++ concurrency. In POPL, 2013.
5. M. Batty, S. Owens, S. Sarkar, P. Sewell, and T.Weber. Mathematizing C++ concurrency. In POPL, 2011.
6. A. Bieniusa, M. Zawirski, N. Preguiça, M. Shapiro, C. Baquero, V. Balegas, and S. Duarte. An optimized conflict-free replicated set. Technical Report 8083, INRIA, 2012.
7. A. Bieniusa, M. Zawirski, N. M. Preguiça, M. Shapiro, C. Baquero, V. Balegas, and S. Duarte. Brief announcement: Semantics of eventually consistent replicated sets. In DISC, 2012.
8. A.-M. Bosneag and M. Brockmeyer. A formal model for eventual consistency semantics. In IASTED PDCS, 2002.
9. S. Burckhardt, R. Alur, and M. M. K. Martin. Checkfence: checking consistency of concurrent data types on relaxed memory models. In PLDI, 2007.
10. S. Burckhardt, M. Fähndrich, D. Leijen, and B. P. Wood. Cloud types for eventual consistency. In ECOOP, 2012.
11. S. Burckhardt, A. Gotsman, and H. Yang. Understanding eventual consistency. Technical Report MSR-TR-2013-39, Microsoft Research, 2013.
12. S. Burckhardt, A. Gotsman, H. Yang, and M. Zawirski. Replicated data types: specification, verification, optimality (extended version), 2013. http://research.microsoft.com/apps/pubs/?id=201602.
13. S. Burckhardt, D. Leijen, M. Fähndrich, and M. Sagiv. Eventually consistent transactions. In ESOP, 2012.
14. B. Charron-Bost. Concerning the size of logical clocks in distributed systems. Information Processing Letters, 39(1), 1991.
15. J.-Y. Chen and G. Pandurangan. Optimal gossip-based aggregate computation. In SPAA, 2010.
16. N. Conway, R. Marczak, P. Alvaro, J. M. Hellerstein, and D. Maier. Logic and lattices for distributed programming. In SOCC, 2012.
17. A. Fekete, D. Gupta, V. Luchangco, N. Lynch, and A. Shvartsman. Eventually-serializable data services. In PODC, 1996.
18. G. DeCandia et al. Dynamo: Amazon's highly available key-value store. In SOSP, 2007.
19. S. Gilbert and N. Lynch. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, 33(2), 2002.
20. M. Helmi, L. Higham, E. Pacheco, and P.Woelfel. The space complexity of long-lived and one-shot timestamp implementations. In PODC, 2011.
21. C. A. R. Hoare. Proof of correctness of data representations. Acta Inf., 1, 1972.
22. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7), 1978.
23. C. Li, D. Porto, A. Clement, R. Rodrigues, N. Preguiça, and J. Gehrke. Making geo-replicated systems fast if possible, consistent when necessary. In OSDI, 2012.
24. H. Liang, X. Feng, and M. Fu. A rely-guarantee-based simulation for verifying concurrent program transformations. In POPL, 2012.
25. B. Liskov and S. Zilles. Programming with abstract data types. In ACM Symposium on Very High Level Languages, 1974.
26. F. Liu, N. Nedev, N. Prisadnikov, M. T. Vechev, and E. Yahav. Dynamic synthesis for relaxed memory models. In PLDI, 2012.
27. W. Lloyd, M. J. Freedman, M. Kaminsky, and D. G. Andersen. Don't settle for eventual: scalable causal consistency for wide-area storage with COPS. In SOSP, 2011.
28. J. Manson, W. Pugh, and S. V. Adve. The Java memory model. In POPL, 2005.
29. F. Mattern. Virtual time and global states of distributed systems. Parallel and Distributed Algorithms, 1989.
30. S. Moran, G. Taubenfeld, and I. Yadin. Concurrent counting. In PODC, 1992.
31. H.-G. Roh, M. Jeon, J.-S. Kim, and J. Lee. Replicated abstract data types: Building blocks for collaborative applications. J. Parallel Distrib. Comput., 71(3), 2011.
32. M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski. A comprehensive study of Convergent and Commutative Replicated Data Types. Technical Report 7506, INRIA, 2011.
33. M. Shapiro, N. M. Preguiça, C. Baquero, and M. Zawirski. Conflictfree replicated data types. In SSS, 2011.
34. Y. Sovran, R. Power, M. K. Aguilera, and J. Li. Transactional storage for geo-replicated systems. In SOSP, 2011.
35. D. B. Terry, A. J. Demers, K. Petersen, M. Spreitzer, M. Theimer, and B.W.Welch. Session guarantees for weakly consistent replicated data. In PDIS, 1994.
36. D. B. Terry, M. M. Theimer, K. Petersen, A. J. Demers, M. J. Spreitzer, and C. H. Hauser. Managing update conflicts in Bayou, a weakly connected replicated storage system. In SOSP, 1995.
37. M. Zawirski, A. Bieniusa, V. Balegas, S. Duarte, C. Baquero, M. Shapiro, and N. Preguiça. SwiftCloud: Fault-tolerant georeplication integrated all the way to the client machine. Technical Report 8347, INRIA, 2013.