A. , M. Neiger, G. Burns, J. E. Kohli, P. And et al., Causal memory: definitions, implementation, and programming, Distributed Computing, vol.9, issue.1, pp.37-49, 1995.

A. , S. Leitão, J. And-rodrigues, and L. , ChainReaction: a causal+ consistent datastore based on Chain Replication, Euro. Conf. on Comp. Sys. (EuroSys), 2013.

A. , H. Ellen, F. And, and A. Morrison, Limitations of highly-available eventually-consistent data stores, Symp. on Principles of Dist. Comp. (PODC), pp.385-394, 2015.

B. , P. Davidson, A. Fekete, A. Ghodsi, A. Hellerstein et al., Highly available transactions: Virtues and limitations, Proc. VLDB Endow, pp.181-192, 2013.

B. , P. Fekete, A. Franklin, M. J. Ghodsi, A. Hellerstein et al., Feral concurrency control: An empirical investigation of modern application integrity, Int. Conf. on the Mgt. of Data (SIGMOD) Assoc. for Computing Machinery, pp.1327-1342, 2015.

B. , P. Fekete, A. Ghodsi, A. Hellerstein, J. M. And-stoica et al., Scalable atomic visibility with RAMP transactions, Int. Conf. on the Mgt. of Data (SIGMOD), 2014.

J. Baker, C. Bond, J. C. Corbett, J. Furman, A. Khorlin et al., Providing scalable, highly available storage for interactive services, Proceedings of the Conference on Innovative Data system Research (CIDR), pp.223-234, 2011.

B. , N. Dahlin, M. Gao, L. Nayate, A. Venkataramani et al., Practi replication, Proceedings of the 3rd Conference on Networked Systems Design & Implementation - NSDI'06, USENIX Association, pp.5-5, 2006.

B. , K. P. And-renesse, and R. V. , Reliable Distributed Computing with the ISIS Toolkit, 1994.

B. , S. Fähndrich, M. Leijen, D. And-sagiv, and M. , Eventually consistent transactions, Euro. Symp. on Programming (ESOP), 2012.

B. , S. Gotsman, A. , Y. , H. And-zawirski et al., Replicated data types: specification, verification, optimality, In ACM SIGPLAN Notices, vol.49, pp.271-284, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00934311

C. , J. C. Dean, J. Epstein, M. Fikes, A. Frost et al., Spanner: Google's globally-distributed database, Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation OSDI'12, USENIX Association, pp.251-264

C. , J. And-liskov, and B. , Granola: Low-overhead distributed transaction coordination, Proceedings of the 2012 USENIX Conference on Annual Technical Conference USENIX ATC'12, USENIX Association, pp.21-21

D. , G. Hastorun, D. Jampani, M. Kakulapati, G. Lakshman et al., Dynamo: Amazon's highly available key-value store, Proceedings of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles SOSP '07, pp.205-220, 2007.

D. , J. Elnikety, S. Roy, A. And-zwaenepoel, and W. , Orbe: Scalable causal consistency using dependency matrices and physical clocks, Symp. on Cloud Computing Assoc. for Computing Machinery, pp.1-1114, 2013.

D. , J. Elnikety, S. And-zwaenepoel, and W. , Clock-si: Snapshot isolation for partitioned data stores using loosely synchronized clocks, Proceedings of the 2013 IEEE 32Nd International Symposium on Reliable Distributed Systems SRDS '13, pp.173-184, 2013.

D. , J. Iorgulescu, C. Roy, A. And-zwaenepoel, and W. , GentleRain: Cheap and scalable causal consistency with physical clocks, Symp. on Cloud Computing, pp.1-4, 2014.

G. , S. And-lynch, and N. , Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services, SIGACT News, vol.33, issue.2, pp.51-59, 2002.

L. , R. Liskov, B. Shrira, L. And-ghemawat, and S. , Providing high availability using lazy replication, Trans. on Computer Systems, vol.10, issue.4, pp.360-391, 1992.

L. , A. And-malik, and P. Cassandra, A decentralized structured storage system, SIGOPS Oper. Syst. Rev, vol.44, issue.2, pp.35-40, 2010.

L. , W. Freedman, M. J. Kaminsky, M. And-andersen, and D. G. , Don't settle for eventual: scalable causal consistency for wide-area storage with COPS, Symp. on Op. Sys. Principles (SOSP) Assoc. for Computing Machinery, pp.401-416, 2011.

L. , W. Freedman, M. J. Kaminsky, M. And-andersen, and D. G. , Stronger semantics for low-latency geo-replicated storage, Networked Sys. Design and Implem. (NSDI), pp.313-328, 2013.

P. , K. Spreitzer, M. Terry, D. And-theimer, and M. Bayou, Replicated database services for world-wide applications, Proceedings of the 7th Workshop on ACM SIGOPS European Workshop: Systems Support for Worldwide Applications, pp.275-280, 1996.

M. Shapiro, N. Preguiça, C. Baquero, and M. And-zawirski, Conflict-Free Replicated Data Types, of Lecture Notes in Comp. Sc, pp.386-400, 2011.
DOI : 10.1007/978-3-642-24550-3_29
URL : https://hal.archives-ouvertes.fr/inria-00609399

S. , Y. Power, R. Aguilera, M. K. And-li, and J. , Transactional storage for geo-replicated systems, Symp. on Op. Sys. Principles (SOSP) Assoc. for Computing Machinery, pp.385-400, 2011.

S. , R. Kreps, J. Gao, L. Feinberg, A. Soman et al., Serving large-scale batch computed data with project voldemort, Proceedings of the 10th USENIX Conference on File and Storage Technologies FAST'12, USENIX Association, pp.18-18

T. , D. B. Demers, A. J. Petersen, K. Spreitzer, M. J. Theimer et al., Session guarantees for weakly consistent replicated data, Parallel and Distributed Information Systems Proceedings of the Third International Conference on, pp.140-149, 1994.

A. Thomson, T. Diamond, S. Weng, K. Ren, P. Shao et al., Fast distributed transactions for partitioned database systems, Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data SIGMOD '12, ACM, pp.1-12

Z. , M. Preguiça, N. Duarte, S. Bieniusa, A. Balegas et al., Write fast, read in the past: Causal consistency for client-side applications, Proceedings of the 16th Annual Middleware Conference Middleware '15, pp.75-87, 2015.