V. Sarita, H. Adve, and . Boehm, Memory models: a case for rethinking parallel languages and hardware, Communications of the ACM, vol.53, issue.8, pp.90-101, 2010.

V. Sarita, K. Adve, and . Gharachorloo, Shared memory consistency models: A tutorial, computer, vol.29, issue.12, pp.66-76, 1996.

V. Sarita, . Adve, D. Mark, and . Hill, Implementing sequential consistency in cachebased systems, Proceedings of the 1990 International Conference on Parallel Processing, pp.47-50, 1990.

K. Marcos, S. Aguilera, V. Frolund, . Hadzilacos, L. Stephanie et al., Abortable and query-abortable objects and their efficient implementation, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pp.23-32, 2007.

M. Ahamad, A. Rida, R. Bazzi, P. John, G. Kohli et al., The power of processor consistency, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures , SPAA '93, pp.251-260, 1993.
DOI : 10.1145/165231.165264

M. Ahamad, G. Neiger, E. James, P. Burns, . Kohli et al., Causal memory: definitions, implementation, and programming, Distributed Computing, pp.37-49, 1995.
DOI : 10.1007/BF01784241

A. Aiyer, L. Alvisi, A. Rida, and . Bazzi, On the availability of nonstrict quorum systems, Distributed Computing, pp.48-62, 2005.

P. Alvaro, N. Conway, M. Joseph, . Hellerstein, R. William et al., Consistency analysis in Bloom: a CALM and collected approach, Proceedings 5th Biennial Conference on Innovative Data Systems Research, pp.249-260, 2011.

T. Andrews, F. Curbera, H. Dholakia, Y. Goland, J. Klein et al., Business process execution language for web services, p.157, 2003.

K. Aslan, P. Molli, H. Skaf-molli, and S. Weiss, C-Set: a commutative replicated data type for semantic stores, RED: Fourth International Workshop on REsource Discovery, p.57, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00594590

H. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM, vol.42, issue.1, pp.124-142, 1995.
DOI : 10.1145/200836.200869

H. Attiya, F. Ellen, and A. Morrison, Limitations of Highly-Available Eventually-Consistent Data Stores, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp.385-394, 2015.

H. Attiya, L. Jennifer, and . Welch, Sequential consistency versus linearizability, ACM Transactions on Computer Systems, vol.12, issue.2, pp.91-122, 1994.
DOI : 10.1145/176575.176576

P. Bailis, A. Fekete, A. Ghodsi, M. Joseph, I. Hellerstein et al., The potential dangers of causal consistency and an explicit solution, Proceedings of the Third ACM Symposium on Cloud Computing, SoCC '12, pp.22-65, 2012.
DOI : 10.1145/2391229.2391251

R. Baldoni, M. Malek, A. Milani, and . Piergiovanni, Weakly-Persistent Causal Objects in Dynamic Distributed Systems, 2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06), pp.165-174, 2006.
DOI : 10.1109/SRDS.2006.47

R. Baldoni, A. Milani, and S. T. Piergiovanni, An optimal protocol for causally consistent distributed shared memory systems, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., pp.68-117, 2004.
DOI : 10.1109/IPDPS.2004.1302998

A. Philip, N. Bernstein, and . Goodman, Multiversion concurrency control?theory and algorithms, ACM Transactions on Database Systems (TODS), vol.8, issue.4, pp.465-483, 1983.

A. Philip, V. Bernstein, N. Hadzilacos, and . Goodman, Concurrency control and recovery in database systems, p.52, 1987.

N. Brian, . Bershad, J. Matthew, and . Zekauskas, Midway: Shared memory parallel programming with entry consistency for distributed memory multiprocessors, p.67, 1991.

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

P. Kenneth, . Birman, A. Thomas, and . Joseph, Reliable communication in the presence of failures, ACM Transactions on Computer Systems (TOCS), vol.5, issue.1, pp.47-76, 1987.

H. Boehm, V. Sarita, and . Adve, Foundations of the C++ concurrency memory model, ACM SIGPLAN Notices, pp.68-78, 2008.

M. Boreale and D. Sangiorgi, A fully abstract semantics for causality in the ??-calculus, STACS 95, pp.243-254, 1995.
DOI : 10.1007/3-540-59042-0_77

Y. Breitbart, D. Georgakopoulos, M. Rusinkiewicz, and A. Silberschatz, On rigorous transaction scheduling, IEEE Transactions on Software Engineering, vol.17, issue.9, pp.954-960, 1991.
DOI : 10.1109/32.92915

A. Eric and . Brewer, Towards robust distributed systems, PODC, page 7, p.123, 2000.

R. Bruni, H. Melgratti, and E. Tuosto, Translating Orc Features into Petri Nets and the Join Calculus, Web Services and Formal Methods, pp.123-137, 2006.
DOI : 10.1007/11841197_8

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, pp.271-284, 2014.
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, Programming Languages and Systems, pp.67-86
DOI : 10.1007/978-3-642-28869-2_4

J. Carlborg and . Orange, https://github.com/jacob-carlborg/orange. Accessed, pp.2016-2022

A. Castaneda, S. Rajsbaum, and M. Raynal, Specifying Concurrent Problems: Beyond Linearizability and up to Tasks, Distributed Computing, pp.420-435, 2015.
DOI : 10.1007/978-3-662-48653-5_28

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

B. Charron-bost, Concerning the size of clocks, Semantics of Systems of Concurrent Processes, pp.176-184, 1990.
DOI : 10.1007/3-540-53479-2_7

D. The, The D Programming Language, pp.2016-2022

F. Brian, R. Cooper, U. Ramakrishnan, A. Srivastava, P. Silberstein et al., PNUTS: Yahoo!'s hosted data serving platform, Proceedings of the VLDB Endowment, pp.1277-1288, 2008.

G. Decandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman et al., Dynamo, ACM SIGOPS Operating Systems Review, vol.41, issue.6, pp.205-220
DOI : 10.1145/1323293.1294281

J. Derrick, B. Dongol, G. Schellhorn, B. Tofan, O. Travkin et al., Quiescent Consistency: Defining and Verifying Relaxed Linearizability, FM 2014: Formal Methods, pp.200-214, 2014.
DOI : 10.1007/978-3-319-06410-9_15

D. Dolev, C. Dwork, and L. Stockmeyer, On the minimal synchronism needed for distributed consensus, Journal of the ACM, vol.34, issue.1, pp.77-97, 1987.
DOI : 10.1145/7531.7533

M. Dubois, C. Scheurich, and F. Briggs, Memory access buffering in multiprocessors, ACM SIGARCH Computer Architecture News, vol.14, issue.2, pp.434-442, 1986.
DOI : 10.1145/17356.17406

S. Dubois, R. Guerraoui, P. Kuznetsov, F. Petit, and P. Sens, The weakest failure detector for eventual consistency, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp.375-384, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01213330

A. Farzan and P. Madhusudan, Causal Atomicity, Computer Aided Verification, pp.315-328, 2006.
DOI : 10.1007/11817963_30

A. Fekete, N. Lynch, and A. Shvartsman, Specifying and using a partitionable group communication service, ACM Transactions on Computer Systems, vol.19, issue.2, pp.171-216, 2001.
DOI : 10.1145/377769.377776

J. Colin and . Fidge, Timestamps in message-passing systems that preserve the partial ordering, p.176, 1987.

J. Michael, . Fischer, A. Nancy, . Lynch, S. Michael et al., Impossibility of distributed consensus with one faulty process, Journal of the ACM (JACM), vol.32, issue.131, pp.374-382, 1985.

R. Friedman, M. Raynal, and F. Taïani, Fisheye Consistency: Keeping Data in Synch in a Georeplicated World, NETYS-3rd International Conference on NETwork sYStems, p.67, 2015.
DOI : 10.1007/978-3-319-26850-7_17

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

P. Gambhire, D. Ajay, and . Kshemkalyani, Reducing False Causality in Causal Message Ordering, High Performance Computing?HiPC, pp.61-72, 2000.
DOI : 10.1007/3-540-44467-X_6

K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta et al., Memory consistency and event ordering in scalable shared-memory multiprocessors, p.67, 1990.

E. Giachino, I. Lanese, and C. A. Mezzina, Causal-Consistent Reversible Debugging, Fundamental Approaches to Software Engineering, pp.370-384, 2014.
DOI : 10.1007/978-3-642-54804-8_26

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

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, pp.51-59, 2002.
DOI : 10.1145/564585.564601

R. James and . Goodman, Cache consistency and sequential consistency, p.64, 1991.

R. Guerraoui and M. Kapalka, On the correctness of transactional memory, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.175-184, 2008.
DOI : 10.1145/1345206.1345233

S. Haar, C. Jard, and G. Jourdan, Testing Input/Output Partial Order Automata, Testing of Software and Communicating Systems, pp.171-185, 2007.
DOI : 10.1007/978-3-540-73066-8_12

V. Hadzilacos, A theory of reliability in database systems, Journal of the ACM, vol.35, issue.1, pp.121-145, 1988.
DOI : 10.1145/42267.42272

V. Hadzilacos and S. Toueg, Reliable Broadcast and Related Problems. Distributed Systems, pp.97-145, 2013.

T. Haerder and A. Reuter, Principles of transaction-oriented database recovery, ACM Computing Surveys, vol.15, issue.4, pp.287-317, 1983.
DOI : 10.1145/289.291

J. Hélary and A. Milani, About the Efficiency of Partial Replication to Implement Distributed Shared Memory, 2006 International Conference on Parallel Processing (ICPP'06), pp.263-270, 2006.
DOI : 10.1109/ICPP.2006.15

M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.
DOI : 10.1145/114005.102808

M. Herlihy, J. Eliot, and B. Moss, Transactional memory: Architectural support for lock-free data structures, p.51, 1993.

P. Maurice, J. M. Herlihy, and . Wing, Linearizability: A correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.12, issue.3, pp.463-492, 1990.

W. Phillip, M. Hutto, and . Ahamad, Slow memory: Weakening consistency to enhance concurrency in distributed shared memories, Distributed Computing Systems Proceedings., 10th International Conference on, pp.302-309, 1990.

D. Imbs and M. Raynal, Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations), Theoretical Computer Science, vol.444, pp.113-127
DOI : 10.1016/j.tcs.2012.04.037

E. Jiménez, A. Fernández, and V. Cholvi, A parametrized algorithm that implements sequential, causal, and cache memory consistencies, Journal of Systems and Software, vol.81, issue.1, pp.120-131, 2008.
DOI : 10.1016/j.jss.2007.03.012

A. Karsenty and M. Beaudouin-lafon, An algorithm for distributed groupware applications, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems, p.79, 1993.
DOI : 10.1109/ICDCS.1993.287708

B. Kemme, One-copy-serializability, Encyclopedia of Database Systems, pp.1947-1948, 2009.

D. Kitchin, R. William, J. Cook, and . Misra, A Language for Task Orchestration and Its Semantic Properties, CONCUR 2006?Concurrency Theory, pp.477-491, 2006.
DOI : 10.1007/11817949_32

D. Kitchin, A. Quark, W. Cook, and J. Misra, The Orc Programming Language, Formal Techniques for Distributed Systems, pp.1-25, 2009.
DOI : 10.1007/11817949_32

M. Kleppmann, A Critique of the CAP Theorem. arXiv preprint, p.49, 2015.

H. Kobashi, Y. Yamane, M. Murata, T. Saeki, H. Moue et al., Eventually Consistent Transaction, Informatics, pp.103-109, 2010.
DOI : 10.2316/P.2010.724-019

A. Lakshman and P. Malik, Cassandra, ACM SIGOPS Operating Systems Review, vol.44, issue.2, pp.35-40, 2010.
DOI : 10.1145/1773912.1773922

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

L. Lamport, How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs, IEEE Transactions on Computers, vol.28, issue.9, pp.690-691, 1979.
DOI : 10.1109/TC.1979.1675439

L. Lamport, Using Time Instead of Timeout for Fault-Tolerant Distributed Systems., ACM Transactions on Programming Languages and Systems, vol.6, issue.2, pp.254-280, 1984.
DOI : 10.1145/2993.2994

L. Lamport, On interprocess communication. Distributed computing, pp.86-101, 1986.

D. Li, L. Zhou, R. Richard, and . Muntz, A new paradigm of user intention preservation in realtime collaborative editing systems, Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568), pp.401-408, 2000.
DOI : 10.1109/ICPADS.2000.857723

J. Richard, . Lipton, S. Jonathan, and . Sandberg, PRAM: A scalable shared memory, pp.42-61, 1988.

W. Lloyd, J. Michael, M. Freedman, . Kaminsky, G. David et al., Don't settle for eventual, Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP '11, pp.401-416, 2011.
DOI : 10.1145/2043556.2043593

P. Mahajan, L. Alvisi, and M. Dahlin, Consistency, availability, and convergence, p.65, 2011.

H. George and . Mealy, A method for synthesizing sequential circuits, Bell System Technical Journal, vol.34, issue.5, pp.1045-1079, 1955.

A. Milani, Causal consistency in static and dynamic distributed systems, La Sapienza, vol.65, p.117, 2006.

J. Misra, Axioms for memory access in asynchronous hardware systems, ACM Transactions on Programming Languages and Systems, vol.8, issue.1, pp.142-153, 1986.
DOI : 10.1145/5001.5007

D. Mosberger, Memory consistency models, ACM SIGOPS Operating Systems Review, vol.27, issue.1, pp.18-26, 1993.
DOI : 10.1145/160551.160553

A. Mostefaoui, M. Perrin, and O. Ruas, CODS D library. https: //github, com/MatthieuPerrin/CODS, vol.Accessed, pp.2016-2022

G. Madhavan-mukund, S. Shenoy, and . Suresh, Optimized or-sets without ordering constraints, Distributed Computing and Networking, pp.227-241

B. Nédelec, P. Molli, A. Mostefaoui, and E. Desmontils, LSEQ, Proceedings of the 2013 ACM symposium on Document engineering, DocEng '13, pp.37-46
DOI : 10.1145/2494266.2494278

G. Neiger, Set-linearizability, Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing , PODC '94, pp.396-51, 1994.
DOI : 10.1145/197917.198176

G. Oster, P. Urso, P. Molli, and A. Imine, Data consistency for P2P collaborative editing, Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work , CSCW '06, pp.259-268, 2006.
DOI : 10.1145/1180875.1180916

URL : https://hal.archives-ouvertes.fr/inria-00108523

H. Christos and . Papadimitriou, The serializability of concurrent database updates, Journal of the ACM (JACM), vol.26, issue.51, pp.631-653, 1979.

M. Perrin, C. Jard, and A. Mostefaoui, Construction d'une sémantique concurrente par instrumentation d'une sémantique opérationelle structurelle, MSR 2013-Modélisation des Systèmes Réactifs, p.159, 2013.

M. Perrin, C. Jard, and A. Mostefaoui, Proof of the Instrumented Semantics for Orc, p.177, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01101340

M. Perrin, C. Jard, and A. Mostefaoui, Tracking Causal Dependencies in Web Services Orchestrations Defined in ORC, NETYS-3rd International Conference on NETwork sYStems, p.159, 2015.
DOI : 10.1007/978-3-319-26850-7_26

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

M. Perrin, A. Mostéfaoui, and C. Jard, Brief Announcement: Update Consistency in Partitionable Systems, Proceedings of the 28th International Symposium on Distributed Computing, pp.546-72, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01079112

M. Perrin, A. Mostéfaoui, and C. Jard, Update Consistency for Wait-Free Concurrent Objects, 2015 IEEE International Parallel and Distributed Processing Symposium, p.72, 2015.
DOI : 10.1109/IPDPS.2015.39

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

M. Perrin, A. Mostéfaoui, and C. Jard, Causal consistency: beyond memory, Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp.26-105, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01286755

K. Petersen, M. J. Spreitzer, B. Douglas, . Terry, M. Marvin et al., Flexible update propagation for weakly consistent replication, ACM SIGOPS Operating Systems Review, vol.31, issue.5, pp.288-301, 1997.
DOI : 10.1145/269005.266711

D. Gordon and . Plotkin, The origins of structural operational semantics, The Journal of Logic and Algebraic Programming, vol.60, pp.3-15, 2004.

N. Preguica, M. Joan, M. Marques, M. Shapiro, and . Letia, A Commutative Replicated Data Type for Cooperative Editing, 2009 29th IEEE International Conference on Distributed Computing Systems, pp.395-403, 2009.
DOI : 10.1109/ICDCS.2009.20

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

M. Raynal, A. Schiper, and S. Toueg, The causal ordering abstraction and a simple way to implement it, Information Processing Letters, vol.39, issue.6, pp.343-350, 1991.
DOI : 10.1016/0020-0190(91)90008-6

URL : https://hal.archives-ouvertes.fr/inria-00075427

M. Raynal and M. Singhal, Logical time: capturing causality in distributed systems, Computer, vol.29, issue.2, pp.49-56, 1996.
DOI : 10.1109/2.485846

S. Rosario, A. Benveniste, S. Haar, and C. Jard, Foundations for Web Services Orchestrations: Functional and QoS Aspects, Jointly, Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006), pp.309-316, 2006.
DOI : 10.1109/ISoLA.2006.8

S. Rosario, A. Benveniste, S. Haar, and C. Jard, Net systems semantics of web services orchestrations modeled in Orc, p.176, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00001103

S. Rosario, D. Kitchin, A. Benveniste, W. Cook, S. Haar et al., Event Structure Semantics of Orc, p.176, 2008.
DOI : 10.1007/978-3-540-79230-7_11

URL : https://hal.archives-ouvertes.fr/inria-00638299

G. Ro¸suro¸su and K. Sen, An instrumentation technique for online analysis of multithreaded programs, Concurrency and Computation: Practice and Experience, vol.28, issue.3, pp.311-325, 2007.
DOI : 10.1002/cpe.1066

O. Ruas, A. Mostéfaoui, and M. Perrin, Weak Consistency Criteria: Conception and Implementation, p.147, 2014.

Y. Saito and M. Shapiro, Optimistic replication, ACM Computing Surveys, vol.37, issue.1, pp.42-81, 2005.
DOI : 10.1145/1057977.1057980

URL : https://hal.archives-ouvertes.fr/inria-00444768

A. Schiper, J. Eggli, and A. Sandoz, A new algorithm to implement causal ordering, Distributed Algorithms, pp.219-232, 1989.
DOI : 10.1007/3-540-51687-5_45

B. Fred and . Schneider, Implementing fault-tolerant services using the state machine approach: A tutorial, ACM Computing Surveys (CSUR), vol.22, issue.4, pp.299-319, 1990.

M. Serafini, D. Dobre, M. Majuntke, P. Bokor, and N. Suri, Eventually linearizable shared objects, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.95-104, 2010.
DOI : 10.1145/1835698.1835723

J. Jaroslav?sev?ik, V. Vafeiadis, F. Z. Nardelli, S. Jagannathan, and P. Sewell, Relaxed-memory concurrency and verified compilation, In ACM SIGPLAN Notices, vol.46, pp.43-54, 2011.

A. Sezgin, Sequential Consistency and Concurrent Data Structures. arXiv preprint

M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski, Conflictfree replicated data types, Stabilization, Safety, and Security of Distributed Systems, pp.386-400, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00609399

M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski, A comprehensive study of convergent and commutative replicated data types, pp.55-139, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00555588

N. Shavit, Data structures in the multicore age, Communications of the ACM, vol.54, issue.3, pp.76-84, 2011.
DOI : 10.1145/1897852.1897873

E. Shenk, The consensus hierarchy is not robust, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, pp.279-50, 1997.
DOI : 10.1145/259380.259479

J. Daniel, . Sorin, D. Mark, . Hill, A. David et al., A primer on memory consistency and cache coherence, Synthesis Lectures on Computer Architecture, vol.6, issue.3, pp.1-212, 2011.

C. Sun, X. Jia, Y. Zhang, Y. Yang, and D. Chen, Achieving convergence, causality preservation, and intention preservation in real-time cooperative editing systems, ACM Transactions on Computer-Human Interaction, vol.5, issue.1, pp.63-108, 1998.
DOI : 10.1145/274444.274447

B. Douglas, A. J. Terry, K. Demers, M. J. Petersen, . Spreitzer 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.

B. Douglas, . Terry, M. Marvin, K. Theimer, A. J. Petersen et al., Managing update conflicts in Bayou, a weakly connected replicated storage system, In ACM SIGOPS Operating Systems Review, vol.29, pp.172-182, 1995.

L. Tseng, A. Benzer, and N. Vaidya, Application-Aware Consistency: An Application to Social Network. arXiv preprint

R. Vitenberg and R. Friedman, On the Locality of Consistency Conditions, Distributed Computing, pp.92-105, 2003.
DOI : 10.1007/978-3-540-39989-6_7

W. Vogels, Eventually consistent, Communications of the ACM, vol.52, issue.1, pp.40-44, 2009.
DOI : 10.1145/1435417.1435432

E. William and . Weihl, Local atomicity properties: modular concurrency control for abstract data types, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.11, issue.2, pp.249-282, 1989.

S. Weiss, P. Urso, and P. Molli, Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks, 2009 29th IEEE International Conference on Distributed Computing Systems, pp.404-412, 2009.
DOI : 10.1109/ICDCS.2009.75

URL : https://hal.archives-ouvertes.fr/inria-00432368

T. Gene, . Wuu, J. Arthur, and . Bernstein, Efficient solutions to the replicated log and dictionary problems. Operating systems review, pp.57-66, 1986.

C. Xie, C. Su, M. Kapritsos, Y. Wang, N. Yaghmazadeh et al., Salt: Combining ACID and BASE in a distributed database, Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation OSDI, pp.495-509

. .. Parisien-et-de-youtube, Violation d'intégrité sur les sites du, p.184

S. Sérialisabilité, .. Validité, .. Ec-convergence, and .. , 128 SL Localité d'état, 108 CC Cohérence causale . . . . . . . . . . . . . . . . . . . . . . . . . 113 SCC Cohérence causale, p.118

. Orc-i-syntaxe-de-la-sémantique-instrumentée.........., 167 ? i Système de transitions de la sémantique instrumentée, p.170