S. V. Adve and K. Gharachorloo, Shared memory consistency models: a tutorial, Computer, vol.29, issue.12, 1996.
DOI : 10.1109/2.546611

J. Alglave, D. Kroening, V. Nimal, and M. Tautschnig, Software Verification for Weak Memory via Program Transformation, ESOP, 2013.
DOI : 10.1007/978-3-642-37036-6_28

M. Batty, M. Dodds, and A. Gotsman, Library abstraction for C/C++ concurrency, POPL, 2013.
DOI : 10.1145/2429069.2429099

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.261.2459

A. Bieniusa, M. Zawirski, N. Preguiça, M. Shapiro, C. Baquero et al., An optimized conflict-free replicated set
URL : https://hal.archives-ouvertes.fr/hal-00738680

A. Bieniusa, M. Zawirski, N. M. Preguiça, M. Shapiro, C. Baquero et al., Brief Announcement: Semantics of Eventually Consistent Replicated Sets, DISC, 2012.
DOI : 10.1007/978-3-642-33651-5_48

URL : https://hal.archives-ouvertes.fr/hal-00769554

A. Bosneag and M. Brockmeyer, A formal model for eventual consistency semantics, IASTED PDCS, 2002.

S. Burckhardt, R. Alur, and M. M. Martin, Checkfence: checking consistency of concurrent data types on relaxed memory models, PLDI, 2007.

S. Burckhardt, M. Fähndrich, D. Leijen, and B. P. Wood, Cloud Types for Eventual Consistency, p.2012
DOI : 10.1007/978-3-642-31057-7_14

S. Burckhardt, A. Gotsman, and H. Yang, Understanding eventual consistency, 2013.

S. Burckhardt, A. Gotsman, H. Yang, and M. Zawirski, Replicated data types, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, p.201602
DOI : 10.1145/2535838.2535848

URL : https://hal.archives-ouvertes.fr/hal-00934311

S. Burckhardt, D. Leijen, M. Fähndrich, and M. Sagiv, Eventually Consistent Transactions, ESOP, 2012.
DOI : 10.1007/978-3-642-28869-2_4

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.4348

B. Charron-bost, Concerning the size of logical clocks in distributed systems, Information Processing Letters, vol.39, issue.1, 1991.
DOI : 10.1016/0020-0190(91)90055-M

J. Chen and G. Pandurangan, Optimal gossip-based aggregate computation, Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures, SPAA '10, 2010.
DOI : 10.1145/1810479.1810504

URL : http://arxiv.org/abs/1001.3242

N. Conway, R. Marczak, P. Alvaro, J. M. Hellerstein, and D. Maier, Logic and lattices for distributed programming, Proceedings of the Third ACM Symposium on Cloud Computing, SoCC '12, 2012.
DOI : 10.1145/2391229.2391230

A. Fekete, D. Gupta, V. Luchangco, N. Lynch, and A. Shvartsman, Eventually-serializable data services, PODC, 1996.
DOI : 10.1016/s0304-3975(98)00239-4

URL : http://doi.org/10.1016/s0304-3975(98)00239-4

G. Decandia, Dynamo: Amazon's highly available key-value store, SOSP, 2007.

S. Gilbert and N. Lynch, Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services, ACM SIGACT News, vol.33, issue.2, 2002.
DOI : 10.1145/564585.564601

M. Helmi, L. Higham, E. Pacheco, and P. Woelfel, The space complexity of long-lived and one-shot timestamp implementations, PODC, 2011.

C. A. Hoare, Proof of correctness of data representations, Acta Inf, vol.1, 1972.

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, 1978.
DOI : 10.1145/359545.359563

C. Li, D. Porto, A. Clement, R. Rodrigues, N. Preguiça et al., Making geo-replicated systems fast if possible, consistent when necessary, OSDI, 2012.

H. Liang, X. Feng, and M. Fu, A rely-guarantee-based simulation for verifying concurrent program transformations, POPL, 2012.

B. Liskov and S. Zilles, Programming with abstract data types, ACM Symposium on Very High Level Languages, 1974.

F. Liu, N. Nedev, N. Prisadnikov, M. T. Vechev, and E. Yahav, Dynamic synthesis for relaxed memory models, PLDI, 2012.

W. Lloyd, M. J. Freedman, M. Kaminsky, and D. G. Andersen, Don't settle for eventual, Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP '11, 2011.
DOI : 10.1145/2043556.2043593

J. Manson, W. Pugh, and S. V. Adve, The Java memory model, POPL, 2005.

F. Mattern, Virtual time and global states of distributed systems. Parallel and Distributed Algorithms, 1989.

S. Moran and G. , Taubenfeld, and I. Yadin. Concurrent counting, PODC, 1992.

H. Roh, M. Jeon, J. Kim, and J. Lee, Replicated abstract data types: Building blocks for collaborative applications, Journal of Parallel and Distributed Computing, vol.71, issue.3, p.71, 2011.
DOI : 10.1016/j.jpdc.2010.12.006

M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski, A comprehensive study of Convergent and Commutative Replicated Data Types, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00555588

M. Shapiro, N. M. Preguiça, C. Baquero, and M. Zawirski, Conflictfree replicated data types, SSS, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00609399

Y. Sovran, R. Power, M. K. Aguilera, and J. Li, Transactional storage for geo-replicated systems, Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP '11, 2011.
DOI : 10.1145/2043556.2043592

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.2632

D. B. Terry, A. J. Demers, K. Petersen, M. Spreitzer, M. Theimer et al., Session guarantees for weakly consistent replicated data, Proceedings of 3rd International Conference on Parallel and Distributed Information Systems, 1994.
DOI : 10.1109/PDIS.1994.331722

D. B. Terry, M. M. Theimer, K. Petersen, A. J. Demers, M. J. Spreitzer et al., Managing update conflicts in Bayou, a weakly connected replicated storage system, SOSP, 1995.

M. Zawirski, A. Bieniusa, V. Balegas, S. Duarte, C. Baquero et al., SwiftCloud: Fault-tolerant georeplication integrated all the way to the client machine, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00870225