quelques notes de lectures (pas très beau, histoire de l'avoir sur le git)

docs/bibliographie/My Library.bib

@@ -0,0 +1,243 @@
+
+@article{saito_optimistic_2005,
+	title = {Optimistic Replication},
+	volume = {37},
+	url = {https://inria.hal.science/hal-01248208},
+	doi = {10.1145/1057977.1057980},
+	abstract = {Data replication is a key technology in distributed systems that enables higher availability and performance. This article surveys optimistic replication algorithms. They allow replica contents to diverge in the short term to support concurrent work practices and tolerate failures in low-quality communication links. The importance of such techniques is increasing as collaboration through wide-area and mobile networks becomes popular.Optimistic replication deploys algorithms not seen in traditional “pessimistic” systems. Instead of synchronous replica coordination, an optimistic algorithm propagates changes in the background, discovers conflicts after they happen, and reaches agreement on the final contents incrementally.We explore the solution space for optimistic replication algorithms. This article identifies key challenges facing optimistic replication systems---ordering operations, detecting and resolving conflicts, propagating changes efficiently, and bounding replica divergence---and provides a comprehensive survey of techniques developed for addressing these challenges.},
+	pages = {42},
+	number = {1},
+	journaltitle = {{ACM} Computing Surveys},
+	author = {Saito, Yasushi and Shapiro, Marc},
+	urldate = {2023-06-09},
+	date = {2005},
+	langid = {english},
+	file = {Saito et Shapiro - 2005 - Optimistic Replication.pdf:/home/amaury/Zotero/storage/4WJX5IAN/Saito et Shapiro - 2005 - Optimistic Replication.pdf:application/pdf},
+}
+
+@article{singh_zeno_nodate,
+	title = {Zeno: Eventually Consistent Byzantine-Fault Tolerance},
+	abstract = {Many distributed services are hosted at large, shared, geographically diverse data centers, and they use replication to achieve high availability despite the unreachability of an entire data center. Recent events show that non-crash faults occur in these services and may lead to long outages. While Byzantine-Fault Tolerance ({BFT}) could be used to withstand these faults, current {BFT} protocols can become unavailable if a small fraction of their replicas are unreachable. This is because existing {BFT} protocols favor strong safety guarantees (consistency) over liveness (availability).},
+	author = {Singh, Atul and Fonseca, Pedro and Kuznetsov, Petr and Rodrigues, Rodrigo and Maniatis, Petros},
+	langid = {english},
+	file = {Singh et al. - Zeno Eventually Consistent Byzantine-Fault Tolera.pdf:/home/amaury/Zotero/storage/K6J2UEBK/Singh et al. - Zeno Eventually Consistent Byzantine-Fault Tolera.pdf:application/pdf},
+}
+
+@inproceedings{shakarami_refresh_2019,
+	title = {Refresh Instead of Revoke Enhances Safety and Availability: A Formal Analysis},
+	volume = {{LNCS}-11559},
+	url = {https://inria.hal.science/hal-02384596},
+	doi = {10.1007/978-3-030-22479-0_16},
+	shorttitle = {Refresh Instead of Revoke Enhances Safety and Availability},
+	abstract = {Due to inherent delays and performance costs, the decision point in a distributed multi-authority Attribute-Based Access Control ({ABAC}) system is exposed to the risk of relying on outdated attribute values and policy; which is the safety and consistency problem. This paper formally characterizes three increasingly strong levels of consistency to restrict this exposure. Notably, we recognize the concept of refreshing attribute values rather than simply checking the revocation status, as in traditional approaches. Refresh replaces an older value with a newer one, while revoke simply invalidates the old value. Our lowest consistency level starts from the highest level in prior revocation-based work by Lee and Winslett ({LW}). Our two higher levels utilize the concept of request time which is absent in {LW}. For each of our levels we formally show that using refresh instead of revocation provides added safety and availability.},
+	eventtitle = {33th {IFIP} Annual Conference on Data and Applications Security and Privacy ({DBSec})},
+	pages = {301},
+	publisher = {Springer International Publishing},
+	author = {Shakarami, Mehrnoosh and Sandhu, Ravi},
+	urldate = {2023-06-09},
+	date = {2019-07-15},
+	langid = {english},
+	file = {Shakarami et Sandhu - 2019 - Refresh Instead of Revoke Enhances Safety and Avai.pdf:/home/amaury/Zotero/storage/XQNWKF7H/Shakarami et Sandhu - 2019 - Refresh Instead of Revoke Enhances Safety and Avai.pdf:application/pdf},
+}
+
+@article{misra_axioms_1986,
+	title = {Axioms for memory access in asynchronous hardware systems},
+	volume = {8},
+	issn = {0164-0925, 1558-4593},
+	url = {https://dl.acm.org/doi/10.1145/5001.5007},
+	doi = {10.1145/5001.5007},
+	abstract = {The problem of concurrent accesses to registers by asynchronous components is considered. A set of axioms about the values in a register during concurrent accesses is proposed. It is shown that if these axioms are met by a register, then concurrent accesses to it may be viewed as nonconcurrent, thus making it possible to analyze asynchronous algorithms without elaborate timing analysis of operations. These axioms are shown, in a certain sense, to be the weakest. Motivation for this work came from analyzing low-level hardware components in a {VLSI} chip which concurrently accesses a flip-flop.},
+	pages = {142--153},
+	number = {1},
+	journaltitle = {{ACM} Transactions on Programming Languages and Systems},
+	shortjournal = {{ACM} Trans. Program. Lang. Syst.},
+	author = {Misra, J.},
+	urldate = {2023-06-08},
+	date = {1986-01-02},
+	langid = {english},
+	file = {Misra - 1986 - Axioms for memory access in asynchronous hardware .pdf:/home/amaury/Zotero/storage/KZP2774N/Misra - 1986 - Axioms for memory access in asynchronous hardware .pdf:application/pdf},
+}
+
+@article{lamport_interprocess_1986,
+	title = {On interprocess communication},
+	volume = {1},
+	issn = {1432-0452},
+	url = {https://doi.org/10.1007/BF01786228},
+	doi = {10.1007/BF01786228},
+	abstract = {Interprocess communication is studied without assuming any lower-level communication primitives. Three classes of communication registers are considered, and several constructions are given for implementing one class of register with a weaker class. The formalism developed in Part I is used in proving the correctness of these constructions.},
+	pages = {86--101},
+	number = {2},
+	journaltitle = {Distributed Computing},
+	shortjournal = {Distrib Comput},
+	author = {Lamport, Leslie},
+	urldate = {2023-06-08},
+	date = {1986-06-01},
+	langid = {english},
+	keywords = {Communication Network, Computer Hardware, Computer System, Operating System, System Organization},
+	file = {Lamport - 1986 - On interprocess communication.pdf:/home/amaury/Zotero/storage/XV7AEARN/Lamport - 1986 - On interprocess communication.pdf:application/pdf},
+}
+
+@book{lipton_pram_1988,
+	title = {{PRAM}: A Scalable Shared Memory},
+	shorttitle = {{PRAM}},
+	pagetotal = {13},
+	publisher = {Princeton University, Department of Computer Science},
+	author = {Lipton, Richard J. and Sandberg, Jonathan S.},
+	date = {1988},
+	langid = {english},
+	note = {Google-Books-{ID}: 962epwAACAAJ},
+	file = {Lipton et Sandberg - 1988 - PRAM A Scalable Shared Memory.pdf:/home/amaury/Zotero/storage/3ZYT3WT4/Lipton et Sandberg - 1988 - PRAM A Scalable Shared Memory.pdf:application/pdf},
+}
+
+@inproceedings{hutto_slow_1990,
+	title = {Slow memory: weakening consistency to enhance concurrency in distributed shared memories},
+	url = {https://www.computer.org/csdl/proceedings-article/icdcs/1990/00089297/12OmNvSKNPr},
+	doi = {10.1109/ICDCS.1990.89297},
+	shorttitle = {Slow memory},
+	abstract = {The use of weakly consistent memories in distributed shared memory systems to combat unacceptable network delay and to allow such systems to scale is proposed. Proposed memory correctness conditions are surveyed, and how they are related by a weakness hierarchy is demonstrated. Multiversion and messaging interpretations of memory are introduced as means of systematically exploring the space of possible memories. Slow memory is presented as a memory that allows the effects of writes to propagate slowly through the system, eliminating the need for costly consistency maintenance protocols that limit concurrency. Slow memory processes a valuable locality property and supports a reduction from traditional atomic memory. Thus slow memory is as expressive as atomic memory. This expressiveness is demonstrated by two exclusion algorithms and a solution to M.J. Fischer and A. Michael's (1982) dictionary problem on slow memory.},
+	eventtitle = {Proceedings.,10th International Conference on Distributed Computing Systems},
+	pages = {302,303,304,305,306,307,308,309--302,303,304,305,306,307,308,309},
+	publisher = {{IEEE} Computer Society},
+	author = {Hutto, P. W. and Ahamad, M.},
+	urldate = {2023-06-06},
+	date = {1990-01-01},
+	file = {Hutto et Ahamad - 1990 - Slow memory weakening consistency to enhance conc.pdf:/home/amaury/Téléchargements/Hutto et Ahamad - 1990 - Slow memory weakening consistency to enhance conc.pdf:application/pdf},
+}
+
+@article{lamport_how_1979,
+	title = {How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs},
+	volume = {C-28},
+	issn = {1557-9956},
+	doi = {10.1109/TC.1979.1675439},
+	abstract = {Many large sequential computers execute operations in a different order than is specified by the program. A correct execution is achieved if the results produced are the same as would be produced by executing the program steps in order. For a multiprocessor computer, such a correct execution by each processor does not guarantee the correct execution of the entire program. Additional conditions are given which do guarantee that a computer correctly executes multiprocess programs.},
+	pages = {690--691},
+	number = {9},
+	journaltitle = {{IEEE} Transactions on Computers},
+	author = {{Lamport}},
+	date = {1979-09},
+	note = {Conference Name: {IEEE} Transactions on Computers},
+	keywords = {Computer design, concurrent computing, hardware correctness, multiprocessing, parallel processing},
+	file = {IEEE Xplore Abstract Record:/home/amaury/Zotero/storage/IVGSSPNE/1675439.html:text/html;Lamport - 1979 - How to Make a Multiprocessor Computer That Correct.pdf:/home/amaury/Zotero/storage/GY8CWGUV/Lamport - 1979 - How to Make a Multiprocessor Computer That Correct.pdf:application/pdf},
+}
+
+@article{mosberger_memory_1993,
+	title = {Memory consistency models},
+	volume = {27},
+	issn = {0163-5980},
+	url = {https://dl.acm.org/doi/10.1145/160551.160553},
+	doi = {10.1145/160551.160553},
+	abstract = {This paper discusses memory consistency models and their influence on software in the context of parallel machines. In the first part we review previous work on memory consistency models. The second part discusses the issues that arise due to weakening memory consistency. We are especially interested in the influence that weakened consistency models have on language, compiler, and runtime system design. We conclude that tighter interaction between those parts and the memory system might improve performance considerably.},
+	pages = {18--26},
+	number = {1},
+	journaltitle = {{ACM} {SIGOPS} Operating Systems Review},
+	shortjournal = {{SIGOPS} Oper. Syst. Rev.},
+	author = {Mosberger, David},
+	urldate = {2023-06-06},
+	date = {1993-01},
+	langid = {english},
+	file = {Mosberger - 1993 - Memory consistency models.pdf:/home/amaury/Zotero/storage/VF2ZNK6A/Mosberger - 1993 - Memory consistency models.pdf:application/pdf},
+}
+
+@inproceedings{hutto_slow_1990-1,
+	title = {Slow memory: weakening consistency to enhance concurrency in distributed shared memories},
+	url = {https://www.computer.org/csdl/proceedings-article/icdcs/1990/00089297/12OmNvSKNPr},
+	doi = {10.1109/ICDCS.1990.89297},
+	shorttitle = {Slow memory},
+	abstract = {The use of weakly consistent memories in distributed shared memory systems to combat unacceptable network delay and to allow such systems to scale is proposed. Proposed memory correctness conditions are surveyed, and how they are related by a weakness hierarchy is demonstrated. Multiversion and messaging interpretations of memory are introduced as means of systematically exploring the space of possible memories. Slow memory is presented as a memory that allows the effects of writes to propagate slowly through the system, eliminating the need for costly consistency maintenance protocols that limit concurrency. Slow memory processes a valuable locality property and supports a reduction from traditional atomic memory. Thus slow memory is as expressive as atomic memory. This expressiveness is demonstrated by two exclusion algorithms and a solution to M.J. Fischer and A. Michael's (1982) dictionary problem on slow memory.},
+	eventtitle = {Proceedings.,10th International Conference on Distributed Computing Systems},
+	pages = {302,303,304,305,306,307,308,309--302,303,304,305,306,307,308,309},
+	publisher = {{IEEE} Computer Society},
+	author = {Hutto, P. W. and Ahamad, M.},
+	urldate = {2023-06-06},
+	date = {1990-01-01},
+}
+
+@incollection{goos_causal_1995,
+	location = {Berlin, Heidelberg},
+	title = {From causal consistency to sequential consistency in shared memory systems},
+	volume = {1026},
+	isbn = {978-3-540-60692-5 978-3-540-49263-4},
+	url = {http://link.springer.com/10.1007/3-540-60692-0_48},
+	pages = {180--194},
+	booktitle = {Foundations of Software Technology and Theoretical Computer Science},
+	publisher = {Springer Berlin Heidelberg},
+	author = {Raynal, Michel and Schiper, André},
+	editor = {Thiagarajan, P. S.},
+	editorb = {Goos, Gerhard and Hartmanis, Juris and Leeuwen, Jan},
+	editorbtype = {redactor},
+	urldate = {2023-06-06},
+	date = {1995},
+	langid = {english},
+	doi = {10.1007/3-540-60692-0_48},
+	note = {Series Title: Lecture Notes in Computer Science},
+	file = {Raynal et Schiper - 1995 - From causal consistency to sequential consistency .pdf:/home/amaury/Zotero/storage/B8UNWUSA/Raynal et Schiper - 1995 - From causal consistency to sequential consistency .pdf:application/pdf},
+}
+
+@thesis{kumar_fault-tolerant_2019,
+	title = {Fault-Tolerant Distributed Services in Message-Passing Systems},
+	institution = {Texas A\&M University},
+	type = {phdthesis},
+	author = {Kumar, Saptaparni},
+	date = {2019},
+	file = {Kumar - 2019 - Fault-Tolerant Distributed Services in Message-Pas.pdf:/home/amaury/Zotero/storage/Q9XK77W9/Kumar - 2019 - Fault-Tolerant Distributed Services in Message-Pas.pdf:application/pdf;Snapshot:/home/amaury/Zotero/storage/7JB26RAJ/1.html:text/html},
+}
+
+@article{somasekaram_high-availability_2022,
+	title = {High-Availability Clusters: A Taxonomy, Survey, and Future Directions},
+	volume = {187},
+	issn = {01641212},
+	url = {http://arxiv.org/abs/2109.15139},
+	doi = {10.1016/j.jss.2021.111208},
+	shorttitle = {High-Availability Clusters},
+	abstract = {The delivery of key services in domains ranging from finance and manufacturing to healthcare and transportation is underpinned by a rapidly growing number of mission-critical enterprise applications. Ensuring the continuity of these complex applications requires the use of software-managed infrastructures called high-availability clusters ({HACs}). {HACs} employ sophisticated techniques to monitor the health of key enterprise application layers and of the resources they use, and to seamlessly restart or relocate application components after failures. In this paper, we first describe the manifold uses of {HACs} to protect essential layers of a critical application and present the architecture of high availability clusters. We then propose a taxonomy that covers all key aspects of {HACs} -- deployment patterns, application areas, types of cluster, topology, cluster management, failure detection and recovery, consistency and integrity, and data synchronisation; and we use this taxonomy to provide a comprehensive survey of the end-to-end software solutions available for the {HAC} deployment of enterprise applications. Finally, we discuss the limitations and challenges of existing {HAC} solutions, and we identify opportunities for future research in the area.},
+	pages = {111208},
+	journaltitle = {Journal of Systems and Software},
+	shortjournal = {Journal of Systems and Software},
+	author = {Somasekaram, Premathas and Calinescu, Radu and Buyya, Rajkumar},
+	urldate = {2023-06-06},
+	date = {2022-05},
+	eprinttype = {arxiv},
+	eprint = {2109.15139 [cs, eess]},
+	keywords = {Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Networking and Internet Architecture, Electrical Engineering and Systems Science - Systems and Control},
+	file = {arXiv.org Snapshot:/home/amaury/Zotero/storage/B4KCP9BG/2109.html:text/html;Somasekaram et al. - 2022 - High-Availability Clusters A Taxonomy, Survey, an.pdf:/home/amaury/Zotero/storage/K3LQZLC8/Somasekaram et al. - 2022 - High-Availability Clusters A Taxonomy, Survey, an.pdf:application/pdf},
+}
+
+@book{perrin_concurrence_2017,
+	title = {Concurrence et cohérence dans les systèmes répartis},
+	isbn = {978-1-78405-295-9},
+	abstract = {La société moderne est de plus en plus dominée par la société virtuelle, le nombre d’internautes dans le monde ayant dépassé les trois milliards en 2015. A la différence de leurs homologues séquentiels, les systèmes répartis sont beaucoup plus difficiles à concevoir, et sont donc sujets à de nombreux problèmes.La cohérence séquentielle fournit la même vue globale à tous les utilisateurs, mais le confort d\&\#39;utilisation qu\&\#39;elle apporte est trop coûteux, voire impossible, à mettre en oeuvre à grande échelle. Concurrence et cohérence dans les systèmes répartis examine les meilleures façons de spécifier les objets que l’on peut tout de même implémenter dans ces systèmes.Cet ouvrage explore la zone grise des systèmes répartis et dresse une carte des critères de cohérence faible, identifiant plusieurs familles et démontrant comment elles peuvent s’intégrer dans un langage de programmation.},
+	pagetotal = {194},
+	publisher = {{ISTE} Group},
+	author = {Perrin, Matthieu},
+	date = {2017-09-01},
+	langid = {french},
+	note = {Google-Books-{ID}: 6DRlDwAAQBAJ},
+	file = {Perrin - 2017 - Concurrence et cohérence dans les systèmes réparti.pdf:/home/amaury/Téléchargements/Perrin - 2017 - Concurrence et cohérence dans les systèmes réparti.pdf:application/pdf},
+}
+
+@article{van_der_linde_practical_2020,
+	title = {Practical client-side replication: weak consistency semantics for insecure settings},
+	volume = {13},
+	issn = {2150-8097},
+	url = {https://dl.acm.org/doi/10.14778/3407790.3407847},
+	doi = {10.14778/3407790.3407847},
+	shorttitle = {Practical client-side replication},
+	abstract = {Client-side replication and direct client-to-client synchronization can be used to create highly available, low-latency interactive applications. Causal consistency, the strongest available consistency model under network partitions, is an attractive consistency model for these applications.},
+	pages = {2590--2605},
+	number = {12},
+	journaltitle = {Proceedings of the {VLDB} Endowment},
+	shortjournal = {Proc. {VLDB} Endow.},
+	author = {Van Der Linde, Albert and Leitão, João and Preguiça, Nuno},
+	urldate = {2023-06-06},
+	date = {2020-08},
+	langid = {english},
+	file = {Van Der Linde et al. - 2020 - Practical client-side replication weak consistenc.pdf:/home/amaury/Zotero/storage/5TJ3SA56/Van Der Linde et al. - 2020 - Practical client-side replication weak consistenc.pdf:application/pdf},
+}
+
+@article{decandia_dynamo_nodate,
+	title = {Dynamo: Amazon’s Highly Available Key-value Store},
+	abstract = {Reliability at massive scale is one of the biggest challenges we face at Amazon.com, one of the largest e-commerce operations in the world; even the slightest outage has significant financial consequences and impacts customer trust. The Amazon.com platform, which provides services for many web sites worldwide, is implemented on top of an infrastructure of tens of thousands of servers and network components located in many datacenters around the world. At this scale, small and large components fail continuously and the way persistent state is managed in the face of these failures drives the reliability and scalability of the software systems.},
+	author = {{DeCandia}, Giuseppe and Hastorun, Deniz and Jampani, Madan and Kakulapati, Gunavardhan and Lakshman, Avinash and Pilchin, Alex and Sivasubramanian, Swaminathan and Vosshall, Peter and Vogels, Werner},
+	langid = {english},
+	file = {DeCandia et al. - Dynamo Amazon’s Highly Available Key-value Store.pdf:/home/amaury/Zotero/storage/KDHRPBGR/DeCandia et al. - Dynamo Amazon’s Highly Available Key-value Store.pdf:application/pdf},
+}

docs/bibliographie/liste_detaille.md

@@ -0,0 +1,28 @@
+# Enumération de la bibliographie étudié
+## Cohérence
+### Très pertinents
+__perrin_concurrence_2017__, "Concurrence et cohérence dans les systèmes répartis":  
+Etat de l'art sur la cohérence dans les systèmes repartis. Présentation d'une approche de modélisation des histoires concurentes. Formaisations de différents critères de cohérences. Comparaison et "hierarchisation" des différents critères de cohérences.
+
+
+### Intéressants mais redondants
+__lamport_interprocess_1986__, "On interprocess communication":  
+Formalisation d'une cohérence séquentiel "single writer"
+
+__misra_axioms_1986__, "Axioms for memory access in asynchronous hardware systems":  
+Exetnsion de lamport_interprocess_1986 dans une approche "multi-writer"
+
+__lipton_pram_1988__, "{PRAM}: A Scalable Shared Memory":  
+Definition de la mémoire PRAM (cohérence pipeline).
+
+## Cohérence en contextes byzantins
+### Algorithmes
+__van_der_linde_practical_2020__, "Practical client-side replication: weak consistency semantics for insecure settings":  
+Algorithme pour de la Cohérence causale BFT. (Reflexions sur des erreurs byzantines possible + algo et implé)
+
+__kumar_fault-tolerant_2019__, "Fault-Tolerant Distributed Services in Message-Passing Systems":  
+Pas spécifiquement à propos des fautes byzantines dans la cohérence faible mais fait un panorama des differentes fautes non-byzantine possibles dans les systèmes distribués.
+
+
+__singh_zeno_2009__, "Zeno: Eventually Consistent Byzantine-Fault Tolerance":  
+Algorithme pour de la convergence BFT. (Reflexions sur des erreurs byzanties possible + algo et implé)

docs/presentations/LIS/DALGO_6_juillet_2023/conclusion/index.tex

@@ -0,0 +1,15 @@
+\begin{frame}
+    \frametitle{Conclusion}
+
+    \begin{block}{What's next ?}
+        \begin{itemize}
+            \item Study and formalize some "in-prod" algoritms using weak consistency in byzantin contexts.
+            \item Continue the colaboration with Parsec:
+            \begin{itemize}
+                \item formalize a list of properties
+                \item provide a proof of concept of a colaborative editor
+            \end{itemize}  
+
+        \end{itemize}
+    \end{block}
+\end{frame}

docs/presentations/LIS/DALGO_6_juillet_2023/consistency/byzantin.tex

@@ -0,0 +1,14 @@
+\begin{frame}
+    \frametitle{The Byzantin context associate to the weak consistency}
+    
+    \begin{block}{Some questions about:}
+        \begin{itemize}
+            \item is the weak consistency introduce new possibility of malicious behaviours.
+            \item is the weak consistency reduce by design the field of milicious behaviours. 
+        \end{itemize}
+    \end{block}
+
+    The state of the art is poor about these questions and few formalized algoritms are avaible.
+    
+
+\end{frame}

docs/presentations/LIS/DALGO_6_juillet_2023/consistency/faible.tex

@@ -0,0 +1,122 @@
+\begin{frame}
+    \frametitle{The models of consistency}
+  
+    \begin{columns}
+      \column{0.6\textwidth}
+      \footnote{Perrin, \emph{Concurrence et cohérence dans les systèmes répartis}, 2017}
+      \resizebox{\columnwidth}{!}{
+        \includegraphics{images/carte_criteres.png}
+      }
+  
+      \column{0.4\columnwidth}
+      \begin{block}{Les classes de cohérences}
+        2 big family :
+        \begin{itemize}
+          \item Strong Consistency
+          \item Weak Consistency :
+          \begin{itemize}
+            \item Eventual Consistency (EC)
+            \item State Locality (SL)
+            \item Validity (V)
+          \end{itemize}
+        \end{itemize}
+      \end{block}
+    \end{columns}
+  \end{frame}
+  
+  \begin{frame}
+    \frametitle{Eventual Consistency (EC)}
+  
+    \begin{block}{Definition}
+        There exist a set of confinite operations where each one must be justify with the same state.  
+    \end{block}
+  
+    \begin{columns}
+      \column{0.4\columnwidth}
+      \begin{tcolorbox}[colframe=green!50!black]
+        \input{schemas/convergence_hc_1}
+      \end{tcolorbox}
+      \column{0.5\columnwidth}
+      $E' = \{r/(1,2)^\omega, r/(1,2)^\omega\}$ \newline
+      $\delta = ((1,2), \emptyset)$ is a valid state justifying $E'$.
+    \end{columns}
+  
+    \begin{columns}
+      \column{0.4\columnwidth}
+      \begin{tcolorbox}[colframe=red!50!black]
+        \input{schemas/convergence_hc_2}
+      \end{tcolorbox}
+      \column{0.5\columnwidth}
+      $E' = \{r/(1,2)^\omega, r/(2,1)^\omega\}$. \newline
+      There exist no state able to justify $E'$ because the two infinite read are not consistent.
+    \end{columns}
+  \end{frame}
+
+  \begin{frame}
+    \frametitle{State Locality}
+  
+    \begin{block}{Definition}
+      For all $p$, there exist one linearization who include all the read operations of $p$. According to the local order of these reads. \\
+    \end{block}
+  
+    \begin{columns}
+      \column{0.4\columnwidth}
+      \begin{tcolorbox}[colframe=green!50!black]
+        \input{schemas/localiteetat_hc_1}
+      \end{tcolorbox}
+      \column{0.5\columnwidth}
+      \begin{math}
+        \begin{array}{l}
+          \textcolor{blue}{C_{p_0} = \{r/(0,0), r/(0,2)^\omega, w(2)\}}, \\
+          \textcolor{red}{C_{p_1} = \{r/(0,0), r/(0,1)^\omega, w(1)\}},  \\
+          \textcolor{blue}{r/(0,0) \bullet w(2) \bullet r/(0,2)^\omega}  \\
+          \textcolor{red}{r/(0,0) \bullet w(1) \bullet r/(0,1)^\omega}   \\
+        \end{array}
+      \end{math}
+    \end{columns}
+  
+    \begin{columns}
+      \column{0.4\columnwidth}
+      \begin{tcolorbox}[colframe=red!50!black]
+        \input{schemas/localiteetat_hc_2}
+      \end{tcolorbox}
+      \column{0.5\columnwidth}
+      $E'_{p_0} = \{r/(0,0), r/(2,1)^\omega\},$ \newline
+      $r/(0,0) \bullet w(2) \bullet w(1) \bullet r/(2,1)^\omega$  \newline
+      $E'_{p_1} = \{r/(0,1), r/(2,1)^\omega\}$. \newline
+      There exist no linearization of $p_1$ satisfying the definition of state locality
+    \end{columns}
+  \end{frame}
+  
+  \begin{frame}
+    \frametitle{Validity (V)}
+  
+    \begin{block}{Definition}
+        There exist a cofinite set of operations such as for each of them must be justified by a linearization of all the write operation.
+    \end{block}
+  
+    \begin{columns}
+      \column{0.4\columnwidth}
+      \begin{tcolorbox}[colframe=green!50!black]
+        \input{schemas/validite_hc_1}
+      \end{tcolorbox}
+      \column{0.5\columnwidth}
+      \begin{math}
+        \begin{array}{ll}
+          E' = & \{r/(2,1)^\omega, r/(1,2)^\omega\}                             \\
+               & w(2) \bullet w(1) \bullet \textcolor{red}{r/(2,1)^\omega} \\
+               & w(1) \bullet w(2) \bullet \textcolor{red}{r/(1,2)^\omega} \\
+        \end{array}
+      \end{math}
+    \end{columns}
+  
+    \begin{columns}
+      \column{0.4\columnwidth}
+      \begin{tcolorbox}[colframe=red!50!black]
+        \input{schemas/validite_hc_2}
+      \end{tcolorbox}
+      \column{0.5\columnwidth}
+      $E' = \{r/(0,1)^\omega, r/(1,2)^\omega\}$. \\
+      There is no linearization of the write operation able to justify $r/(0,1)^\omega$.
+    \end{columns}
+  \end{frame}

docs/presentations/LIS/DALGO_6_juillet_2023/consistency/forte.tex

@@ -0,0 +1,45 @@
+\begin{frame}
+    \frametitle{Safety}
+    \begin{block}{Definition}
+        Each \textbf{read} operation made in the same \textbf{non-competitor} context provide the same result.
+    \end{block}
+    \begin{figure}
+        \input{schemas/linearisation_surete_hc}
+    \end{figure}
+  \end{frame}
+  
+  \begin{frame}
+    \frametitle{Regularity}
+    \begin{block}{Definition}
+        An \textbf{reading operation concurrent with a writing operation} must provide the value \textbf{before or after the write}.
+    \end{block}
+    \begin{figure}
+        \input{schemas/linearisation_regularite_hc}
+    \end{figure}
+  \end{frame}
+  
+  \begin{frame}
+    \frametitle{Atomicity}
+    \begin{block}{Definition}
+        If \textbf{two reading are non-competitor}, the second one must provide a value \textbf{at least as recent as} the previous one.
+    \end{block}
+    \begin{figure}
+        \input{schemas/linearisation_atomicite_hc}
+    \end{figure}
+  \end{frame}
+  
+  \begin{frame}
+    \frametitle{Atomic Consistency ($C_\top$)}
+  
+    \begin{block}{Définition}
+        Atomic consistency is the stronger consistency class.
+      \begin{itemize}
+        \item Provide an awful interactivity.
+        \item Need a strong synchronization between each operation.
+        \begin{itemize}
+          \item Each read or write operation lock the others and need to wait the realease from the previous one.
+        \end{itemize} 
+        \item He's used as a reference for the other consistency class.
+      \end{itemize}
+    \end{block}
+  \end{frame}

docs/presentations/LIS/DALGO_6_juillet_2023/consistency/index.tex

@@ -0,0 +1,8 @@
+\subsection{Strong consistency}
+\include{consistency/forte.tex}
+
+\subsection{The compromises of the strong consistency}
+\include{consistency/faible.tex}
+
+\subsection{In a malicious context ?}
+\include{consistency/byzantin.tex}

docs/presentations/LIS/DALGO_6_juillet_2023/distr_sys/bases.tex

@@ -0,0 +1,32 @@
+\begin{frame}
+    \frametitle{A distributed system}
+
+    \begin{block}{Definition}
+        A distributed system is a group of \textbf{actors} able to comunicate \textbf{each-other} working together to \textbf{complete a common task}.
+    \end{block}
+    
+    % Schéma d'un système distribué
+
+    The system we consider on this presentation is a \textbf{asynchronous message-passing} system.
+
+\end{frame}
+
+\begin{frame}
+    \frametitle{A distributed system is a living system}
+
+    A distributed system changes over time.
+
+    There's some way to study these changes :
+    \begin{itemize}
+        \item focus on the \textbf{churn} (node addition and removal).
+        \item focus on the \textbf{messages}.
+        \item focus on the \textbf{connectedness}.
+        \item focus on the \textbf{states}. $\Leftarrow$
+        \item probably more... ?
+    \end{itemize}
+
+    The study of the state changes is also called the study of \textbf{consistency}.
+
+    \textbf{A small exemple}: A peer-to-peer discussion
+
+\end{frame}

docs/presentations/LIS/DALGO_6_juillet_2023/distr_sys/index.tex

@@ -0,0 +1,2 @@
+\subsection{Définition}
+\include{distr_sys/bases}

docs/presentations/LIS/DALGO_6_juillet_2023/intro/index.tex

@@ -0,0 +1,5 @@
+\subsection{Introduction}
+\include{intro/presentation.tex}
+
+\subsection{My internship}
+\include{intro/suite.tex}

docs/presentations/LIS/DALGO_6_juillet_2023/intro/presentation.tex

@@ -0,0 +1,16 @@
+\begin{frame}
+    \frametitle{Présentation}
+
+    \begin{itemize}
+        \item Amaury JOLY
+        \item Master Informatique
+        \begin{itemize}
+            \item Option Fiabilité Sécurité Informatique (FSI)
+        \end{itemize}
+        
+    \end{itemize}
+
+
+    
+
+\end{frame}

docs/presentations/LIS/DALGO_6_juillet_2023/intro/suite.tex

@@ -0,0 +1,18 @@
+\begin{frame}
+    \frametitle{My Internship}
+
+    \begin{itemize}
+        \item Begin in april
+        \item Collaboration between Parsec and LIS-LAB
+        \begin{itemize}
+            \item Parsec is a for-profit organization working on an open-source software named Parsec
+            \item It's a software architecture to file sharing with E2EE in a zero-trust approach    
+        \end{itemize}
+        \item Parsec want to add Collaborative Editing on their products:
+        \begin{itemize}
+            \item With a zero-trust approach (so probably decentralized)
+            \item With a high avaibility and low latency approach
+        \end{itemize}
+        \item Subject is \textit{Weak Consistency Byzantin Fault Tolerent}
+    \end{itemize}
+\end{frame}

docs/presentations/LIS/DALGO_6_juillet_2023/main.tex

@@ -0,0 +1,60 @@
+\documentclass{beamer}
+\usetheme{Boadilla}
+\usecolortheme{orchid}
+
+\usepackage[T1]{fontenc}
+\usepackage[utf8]{inputenc}
+\usepackage[french]{babel}
+\usepackage{stackengine}
+
+\addtobeamertemplate{navigation symbols}{}{%
+    \usebeamerfont{footline}%
+    \usebeamercolor[fg]{footline}%
+    \hspace{1em}%
+    \insertframenumber/\inserttotalframenumber
+}
+\usepackage{ulem}
+\usepackage{tkz-tab}
+\setbeamertemplate{blocks}[rounded]%
+[shadow=true]
+\AtBeginSection{%
+    \begin{frame}
+        \tableofcontents[sections=\value{section}]
+    \end{frame}
+}
+
+\usepackage{tikz}
+\usetikzlibrary{positioning}
+\usetikzlibrary{calc}
+\usetikzlibrary{arrows.meta}
+
+\usepackage{tcolorbox}
+
+\title[bwconsistency]{Étude de la cohérence dans les systèmes distribués}
+\subtitle{Journée DALGO}
+\author[JOLY Amaury]{JOLY Amaury\\ \textbf{Encadrants :} GODARD Emmanuel, TRAVERS Corentin }
+% \\[2ex] \includegraphics[scale=0.1]{./img/amu.png}
+\institute[LIS, Scille]{LIS-LAB, Scille}
+\date{6 juillet 2023}
+
+\begin{document}
+
+\maketitle
+
+\begin{frame}{Table des matières}
+  \tableofcontents
+\end{frame}
+
+\section{Introduction}
+\input{intro/index.tex}
+
+\section{Distributed systems and consistency}
+\input{distr_sys/index.tex}
+
+\section{The compromises of consistency}
+\input{consistency/index.tex}
+
+\section{What's next ?}
+\input{conclusion/index.tex}
+
+\end{document}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/convergence_hc_1.tex

@@ -0,0 +1,41 @@
+\resizebox{\columnwidth}{!}{
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$I(a)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,1)$};
+        \node[roundnode] (14) [right=35pt of 13] {};
+        \node[above] at (14.north) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+        \draw[arrow] (13) -- (14);
+
+        \node[roundnode] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$R/\emptyset$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(0,2)$};
+        \node[roundnode] (24) [right=35pt of 23] {};
+        \node[below] at (24.south) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+        \draw[arrow] (23) -- (24);
+
+        \draw (24) -- (14);
+
+        \draw[dashed] ($(14)!0.5!(13) + (0,1)$) -- ++(0, -2.9);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/convergence_hc_2.tex

@@ -0,0 +1,41 @@
+\resizebox{\columnwidth}{!}{
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$I(a)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,1)$};
+        \node[roundnode] (14) [right=35pt of 13] {};
+        \node[above] at (14.north) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+        \draw[arrow] (13) -- (14);
+
+        \node[roundnode] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$R/\emptyset$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(0,2)$};
+        \node[roundnode] (24) [right=35pt of 23] {};
+        \node[below] at (24.south) {$r/(2,1)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+        \draw[arrow] (23) -- (24);
+
+        \draw (24) -- (14);
+
+        \draw[dashed] ($(14)!0.5!(13) + (0,1)$) -- ++(0, -2.9);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/linearisation_atomicite_hc.tex

@@ -0,0 +1,26 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundedrectangle/.style={draw, rounded corners, rectangle, minimum height=10pt, minimum width=20pt},
+        invisible/.style={draw=none, fill=none},
+        ]
+
+        \node[invisible] (10) {};
+        \node[roundedrectangle, minimum width=150pt] (11) [right=100pt of 10] {$w_x(1)$};
+        \node[invisible] (12) [right=100pt of 11] {};
+
+        \node[invisible] (20) [below=15pt of 10] {};
+        \node[roundedrectangle, minimum width=50pt] (21) [right=25pt of 20] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (22) [right=75pt of 21] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (23) [right=75pt of 22] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (24) [below=15pt of 12] {};
+
+        \node[invisible] (30) [below=15pt of 20] {};
+        \node[roundedrectangle, minimum width=50pt] (31) [right=125pt of 30] {\textcolor{red}{$r/(1)$}};
+        \node[roundedrectangle, minimum width=50pt] (32) [right=40pt of 31] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (33) [below=15pt of 24] {};
+
+        \draw (10) -- (11) -- (12);
+        \draw (20) -- (21) -- (22) -- (23) -- (24);
+        \draw (30) -- (31) -- (32) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/linearisation_regularite_hc.tex

@@ -0,0 +1,26 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundedrectangle/.style={draw, rounded corners, rectangle, minimum height=10pt, minimum width=20pt},
+        invisible/.style={draw=none, fill=none},
+        ]
+
+        \node[invisible] (10) {};
+        \node[roundedrectangle, minimum width=150pt] (11) [right=100pt of 10] {$w_x(1)$};
+        \node[invisible] (12) [right=100pt of 11] {};
+
+        \node[invisible] (20) [below=15pt of 10] {};
+        \node[roundedrectangle, minimum width=50pt] (21) [right=25pt of 20] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (22) [right=75pt of 21] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (23) [right=75pt of 22] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (24) [below=15pt of 12] {};
+
+        \node[invisible] (30) [below=15pt of 20] {};
+        \node[roundedrectangle, minimum width=50pt] (31) [right=125pt of 30] {\textcolor{red}{$r/(1)$}};
+        \node[roundedrectangle, minimum width=50pt] (32) [right=40pt of 31] {\textcolor{blue}{$r/(0)$}};
+        \node[invisible] (33) [below=15pt of 24] {};
+
+        \draw (10) -- (11) -- (12);
+        \draw (20) -- (21) -- (22) -- (23) -- (24);
+        \draw (30) -- (31) -- (32) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/linearisation_surete_hc.tex

@@ -0,0 +1,26 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundedrectangle/.style={draw, rounded corners, rectangle, minimum height=10pt, minimum width=20pt},
+        invisible/.style={draw=none, fill=none},
+        ]
+
+        \node[invisible] (10) {};
+        \node[roundedrectangle, minimum width=150pt] (11) [right=100pt of 10] {$w_x(1)$};
+        \node[invisible] (12) [right=100pt of 11] {};
+
+        \node[invisible] (20) [below=15pt of 10] {};
+        \node[roundedrectangle, minimum width=50pt] (21) [right=25pt of 20] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (22) [right=75pt of 21] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (23) [right=75pt of 22] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (24) [below=15pt of 12] {};
+
+        \node[invisible] (30) [below=15pt of 20] {};
+        \node[roundedrectangle, minimum width=50pt] (31) [right=125pt of 30] {\textcolor{red!50!blue}{$r/(27)$}};
+        \node[roundedrectangle, minimum width=50pt] (32) [right=40pt of 31] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (33) [below=15pt of 24] {};
+
+        \draw (10) -- (11) -- (12);
+        \draw (20) -- (21) -- (22) -- (23) -- (24);
+        \draw (30) -- (31) -- (32) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/localiteetat_hc_1.tex

@@ -0,0 +1,34 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode, draw=red, fill=red] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode, draw=blue, fill=blue] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,0)$};
+        \node[roundnode, draw=blue, fill=blue] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode, draw=blue, fill=blue] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode, draw=red, fill=red] (22) [right=of 21] {};
+        \node[below] at (22.south) {$r/(0,0)$};
+        \node[roundnode, draw=red, fill=red] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(0,1)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+
+        \draw[message] (11) -- ($(22)!0.5!(23)$);
+        \draw[message] (21) -- ($(12)!0.5!(13)$);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/localiteetat_hc_2.tex

@@ -0,0 +1,32 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,0)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$r/(0,1)$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(2,1)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/validite_hc_1.tex

@@ -0,0 +1,31 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,1)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(2,1)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$r/(0,2)$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/validite_hc_2.tex

@@ -0,0 +1,31 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,1)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,1)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode] (21) [below=10ptof 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$r/(0,2)$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/wcc_hc_1.tex

@@ -0,0 +1,42 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode, color=red] (11) {};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode, color=red!50] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,1)$};
+        \node[roundnode, color=red!25] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(3,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode, color=green!75!black] (21) [below=20pt of 11] {};
+        \node[left] at (21.west) {$r/(3,1)$};
+        \node[roundnode, color=green!95!black] (22) [right=of 21] {};
+        \node[right] at (22.east) {$w(2)$};
+
+        \draw[arrow] (21) -- (22);
+
+        \node[roundnode, color=blue] (31) [below=20pt of 21] {};
+        \node[below] at (31.south) {$w(3)$};
+        \node[roundnode, color=blue!50] (32) [right=of 31] {};
+        \node[below] at (32.south) {$r/(3,1)$};
+        \node[roundnode, color=blue!25] (33) [right=of 32] {};
+        \node[below] at (33.south) {$r/(3,2)^\omega$};
+
+        \draw[arrow] (31) -- (32);
+        \draw[arrow] (32) -- (33);
+
+        \draw[message] (11) -- (21);
+        \draw[message] (31) -- (21);
+        \draw[message] (21) -- (32);
+        \draw[message] (22) -- (13);
+        \draw[message] (22) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/wcc_hc_2.tex

@@ -0,0 +1,29 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(2,1)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(2,1)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode] (21) [below=20pt of 11] {};
+        \node[left] at (21.west) {$r/(0,1)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[right] at (22.east) {$w(2)$};
+
+        \draw[arrow] (21) -- (22);
+
+        \draw[message] (11) -- (21);
+        \draw[message] (22) -- (12);
+    \end{tikzpicture}
+}

docs/presentations/LIS/DALGO_6_juillet_2023/schemas/wcc_hc_3.tex

@@ -0,0 +1,41 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode, color=red] (11) {};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode, color=red!50] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(3,1)$};
+        \node[roundnode, color=red!25] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode, color=green!75!black] (21) [below=20pt of 11] {};
+        \node[left] at (21.west) {$r/(0,0)$};
+        \node[roundnode, color=green!95!black] (22) [right=of 21] {};
+        \node[right] at (22.east) {$w(2)$};
+
+        \draw[arrow] (21) -- (22);
+
+        \node[roundnode, color=blue] (31) [below=20pt of 21] {};
+        \node[below] at (31.south) {$w(3)$};
+        \node[roundnode, color=blue!50] (32) [right=of 31] {};
+        \node[below] at (32.south) {$r/(1,3)$};
+        \node[roundnode, color=blue!25] (33) [right=of 32] {};
+        \node[below] at (33.south) {$r/(3,2)^\omega$};
+
+        \draw[arrow] (31) -- (32);
+        \draw[arrow] (32) -- (33);
+
+        \draw[message] (11) -- (31);
+        \draw[message] (31) -- (12);
+        \draw[message] (22) -- (13);
+        \draw[message] (22) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/LIS/consistence_faible/définition/index.tex

@@ -4,4 +4,4 @@
 \include{définition/adt}
 
 \subsection{Définition du modèle}
-% \include{définition/modele}
+\include{définition/modele}

docs/presentations/LIS/vanderlinde/corps/attaques.tex

@@ -0,0 +1,69 @@
+\begin{frame}
+  \frametitle{Résumé de l'article}
+
+  \begin{block}{Apports}
+    \begin{itemize}
+      \item Formalisation des attaques possibles sur les systèmes satisfaisant la convergence causale.
+      \item Définition de propriétés permettant de contrer ou de limiter ces attaques.
+      \item Formalisation de "nouvelles" classes de cohérence faible étendant la cohérence causale à ces propriétés : "Secure Causal Consistency".
+      \item Présentation d'algorithmes produisant des histoires satisfaisant cette classe.
+      \item Expérimentation de ces algorithmes et comparaison avec les algorithmes existants.
+    \end{itemize}
+  \end{block}
+
+\end{frame}
+
+\begin{frame}
+  \frametitle{Résumé de l'article}
+
+  \begin{block}{Attentes}
+    Les auteurs cherchent à produire un algorithme maximisant l'interactivité et donc minimisant la latence. \newline
+    L'architecture étudiée est une architecture client-serveur, avec une connectivité en pair à pair entre les clients. 
+  \end{block}
+
+  Illustration de l'architecture
+
+\end{frame}
+
+\begin{frame}
+  \frametitle{Attaques}
+
+  \begin{block}{Attaques}
+    \begin{itemize}
+      \item \textbf{Tempering} : Anticipation d'une opération reçue par le système, mais pas encore exécutée par l'ensemble des nœuds.
+      \item \textbf{Omitting Dependencies} : Création d'une opération suivant un sous ensemble des dépendances réelles.
+      \item \textbf{Unseen Dependencies} : Anticipation d'une opération non reçue par le système, mais probable d'arrivée.
+      \item \textbf{Sibling Generation} : Création de deux opérations différentes possédant le même identifiant. Réalisant ainsi une divergence entre les nœuds. 
+    \end{itemize}
+  \end{block} 
+\end{frame}
+
+\begin{frame}
+  \frametitle{Propriétés}
+
+  \begin{block}{Propriétés}
+    \begin{itemize}
+      \item \textbf{Immutable History} : Chaque opération est envoyée avec son passé causal. (Parade le \textbf{Tempering})
+      \item \textbf{No Future Dependencies} : Chaque opération est envoyée avec l'état qu'il connait des nœuds. (Parade l'\textbf{Unseen Dependencies}, il devient impossible de créer une opération à l'avance).
+      \item \textbf{Causal Execution} : Toute opération $o_i$ appartenant au passé causal d'une opération $o$ doit être sérialisable t.q. : $o_i < o$. (Fait office de synchronisation entre les nœuds)
+      \item \textbf{Eventual Sibling Detection} : Les opérations sont considérées comme des "jumeaux" éventuels et sont donc "révocables" via une nouvelle opération dédiée. (Parade (relativement) le \textbf{Sibling Generation})
+      \item \textbf{Limited Omission} : à travailler
+    \end{itemize}
+  \end{block}
+
+  Ces propriétés définissent la première classe que les auteurs introduisent : \textbf{Secure Causal Consistency}.
+\end{frame}
+
+\begin{frame}
+  \frametitle{Les différentes classes de cohérence faible}
+
+  \begin{block}{Les différentes classes de cohérence faible}
+    \begin{itemize}
+      \item \textbf{Secure Causal Consistency} : Respecte les propriétés précédentes ainsi que celles introduites par la convergence causale.
+      \item \textbf{Secure Strict Causal Consistency} : Extension de la précédente, mais avec un ordre total basé sur la vision d'un observateur externe.
+      \item \textbf{Extended Secure Causal Consistency} : 
+    \end{itemize}
+  \end{block}
+  
+
+\end{frame}

docs/presentations/LIS/vanderlinde/corps/index.tex

@@ -0,0 +1 @@
+\input{corps/attaques.tex}

docs/presentations/LIS/vanderlinde/intro/coherencecausale.tex

@@ -0,0 +1,88 @@
+\begin{frame}
+    \frametitle{Cohérence Causale (Convergente)}
+
+    \begin{columns}
+        \column{0.5\textwidth}
+        \resizebox{\columnwidth}{!}{
+            \includegraphics{images/carte_criteres.png}
+        }
+
+        \column{0.5\columnwidth}
+        \begin{block}{La cohérence causale selon Van Der Linde}
+            Usage du terme \textbf{Causal Consistency} qui pourrait être confondue avec la Cohérence Causale de Perrin. \newline
+            Mais s'approche plus de ce que Perrin qualifie de \textbf{Convergence Causale} (ou Causal Convergence (CCv)). \newline
+            Les auteurs souhaitent privilégier la \textbf{Convergence} à la \textbf{Validité}.
+        \end{block}
+    \end{columns}
+\end{frame}
+
+\begin{frame}
+    \frametitle{Cohérence Causale Faible (WCC)}
+
+    \begin{block}{Définition}
+        Il existe un ordre causal tel que pour chaque lecture, il existe une linéarisation du passé causal de cet événement le justifiant.
+    \end{block}
+
+    \only<1>{
+        \begin{columns}
+            \column{0.4\columnwidth}
+            \begin{tcolorbox}[colframe=green!50!black]
+                \input{schemas/wcc_hc_1}
+            \end{tcolorbox}
+            \column{0.5\columnwidth}
+            $\textcolor{red}{w(1)} \bullet \textcolor{red!50}{r/(0,1)}$ \newline
+            $\textcolor{blue}{w(3)} \bullet \textcolor{red}{w(1)} \bullet \textcolor{green!75!black}{r/(3,1)}$ \newline
+            $\textcolor{blue}{w(3)} \bullet \textcolor{red}{w(1)} \bullet \textcolor{green!75!black}{r} \bullet \textcolor{blue!50}{r/(3,1)}$ \newline
+            $\textcolor{red}{w(1)} \bullet \textcolor{blue}{w(3)} \bullet \textcolor{green!75!black}{r} \bullet \textcolor{green!95!black}{w(2)} \bullet \textcolor{red!25}{r/(3,2)}$ \newline
+            $\textcolor{red}{w(1)} \bullet \textcolor{blue}{w(3)} \bullet \textcolor{green!75!black}{r} \bullet \textcolor{green!95!black}{w(2)} \bullet \textcolor{blue!50}{r} \bullet \textcolor{blue!25}{r/(3,2)}$ \newline
+        \end{columns}
+
+
+        \begin{columns}
+            \column{0.4\columnwidth}
+            \begin{tcolorbox}[colframe=red!50!black]
+                \input{schemas/wcc_hc_2}
+            \end{tcolorbox}
+            \column{0.5\columnwidth}
+            $w(1) \bullet r/(0,1)$ \newline
+            Ici il n'est pas possible de trouver un ordre causal qui permette de linéariser le passé causal de $r/(2,1)$.
+        \end{columns}
+    }
+
+    \only<2>{
+        \begin{columns}
+            \column{0.4\columnwidth}
+            \begin{tcolorbox}[colframe=green!50!black]
+                \input{schemas/wcc_hc_3}
+            \end{tcolorbox}
+            \column{0.5\columnwidth}
+            $\textcolor{green!75!black}{r/(0,0)}$ \newline
+            $\textcolor{red}{w(1)} \bullet \textcolor{blue}{w(3)} \bullet \textcolor{red!50}{r/(3,1)}$ \newline
+            $\textcolor{blue}{w(3)} \bullet \textcolor{red}{w(1)} \bullet \textcolor{blue!50}{r/(1,3)}$ \newline
+            $\textcolor{red}{w(1)} \bullet \textcolor{blue}{w(3)} \bullet \textcolor{green!75!black}{r} \bullet \textcolor{green!95!black}{w(2)} \bullet \textcolor{red!25}{r/(1,2)^\omega}$ \newline
+            $\textcolor{blue}{w(3)} \bullet \textcolor{red}{w(1)} \bullet \textcolor{blue!50}{r} \bullet \textcolor{green!75!black}{r} \bullet \textcolor{green!95!black}{w(2)} \bullet \textcolor{blue!25}{r/(3,2)^\omega}$ \newline
+
+            Cet exemple respecte la validité, mais pas la convergence.
+         \end{columns}
+    }
+\end{frame}
+
+\begin{frame}
+    \frametitle{Convergence Causale (CCv)}
+
+    \begin{block}{Définition}
+        Il existe un ordre causal et un ordre total tel que pour chaque lecture, il existe une linéarisation du passé causal de cet événement trié suivant l'ordre total le justifiant.
+    \end{block}
+
+    \begin{columns}
+        \column{0.4\columnwidth}
+        \begin{tcolorbox}[colframe=green!50!black]
+            \resizebox{1.2\columnwidth}{!}{
+                \includegraphics{schemas/ccv_hc_1.png}
+            }
+        \end{tcolorbox}
+        \column{0.5\columnwidth}
+        % J'expliquerai au tableau
+    \end{columns}
+
+\end{frame}

docs/presentations/LIS/vanderlinde/intro/history.tex

@@ -0,0 +1,36 @@
+\subsubsection{Le début de l'informatique distribuée}
+\begin{frame}
+  \frametitle{Les processeurs multicœurs}
+
+  \begin{block}{Historique (1970)}
+    \begin{itemize}
+      \item Besoin d'augmenter les performances des processeurs
+      \begin{itemize}
+        \item Augmentation de la fréquence (limite physique)
+        \item Augmentation du nombre de processeurs (problèmes de cohérence)
+      \end{itemize}
+      \item Lamport à défini des propriétés permettant de définir la notion de cohérence forte.
+      \item L'approche de Lamport est de classer l'exécution et non pas l'algorithme.
+    \end{itemize}
+    \begin{quotation}
+      "A correct execution is achieved if the results produced are the same as would be produced by executing the program steps in order."
+      \footnote{Lamport, \emph{How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs}, 1979}
+    \end{quotation}
+  \end{block}
+\end{frame}
+
+\begin{frame}
+  \frametitle{La généralisation aux systèmes distribuée}
+  \begin{block}{Historique (1980)}
+    \begin{itemize}
+      \item Lamport étend sa définition de la cohérence forte aux systèmes distribués. \footnote{Lamport, \emph{On interprocess communication}, 1986}
+      \item Il définit trois propriétés :
+      \begin{itemize}
+        \item \textbf{Sûreté}
+        \item \textbf{Régularité}
+        \item \textbf{Atomicité}
+      \end{itemize}
+      \item Une exécution qui respecte ces 3 propriétés est dite linéarisable.
+    \end{itemize}
+  \end{block}
+\end{frame}

docs/presentations/LIS/vanderlinde/intro/index.tex

@@ -0,0 +1,11 @@
+\subsection{Historique}
+\include{intro/history.tex}
+
+\subsection{La linéarisabilité}
+\include{intro/linearisabilite.tex}
+
+\subsection{Rappels}
+\include{intro/rappel.tex}
+
+\subsection{Cohérence Causale (Convergente)}
+\include{intro/coherencecausale.tex}

docs/presentations/LIS/vanderlinde/intro/linearisabilite.tex

@@ -0,0 +1,45 @@
+\begin{frame}
+  \frametitle{Sûreté}
+  \begin{block}{Définition}
+      Toute lecture réalisée dans un même environnement non-concurrent est identique.
+  \end{block}
+  \begin{figure}
+      \input{schemas/linearisation_surete_hc}
+  \end{figure}
+\end{frame}
+
+\begin{frame}
+  \frametitle{Régularité}
+  \begin{block}{Définition}
+      Une lecture concurrente à une écriture peut lire soit la valeur avant l'écriture, soit la valeur après l'écriture.
+  \end{block}
+  \begin{figure}
+      \input{schemas/linearisation_regularite_hc}
+  \end{figure}
+\end{frame}
+
+\begin{frame}
+  \frametitle{Atomicité}
+  \begin{block}{Définition}
+      Si deux lectures ne sont pas concurrente la deuxième doit retourner une valeur au moins aussi récente que la première.
+  \end{block}
+  \begin{figure}
+      \input{schemas/linearisation_atomicite_hc}
+  \end{figure}
+\end{frame}
+
+\begin{frame}
+  \frametitle{Cohérence Atomique ($C_\top$)}
+
+  \begin{block}{Définition}
+    La cohérence atomique est le critère de cohérence le plus fort existant.
+    \begin{itemize}
+      \item Il est le moins efficace en terme d'interactivité.
+      \item Il demande une synchronisation entre les opérations
+      \begin{itemize}
+        \item Chaque opération d'écriture ou de lecture est bloquante et doit attendre la fin de la précédente.
+      \end{itemize} 
+      \item Il est utilisé en tant que référence.
+    \end{itemize}
+  \end{block}
+\end{frame}

docs/presentations/LIS/vanderlinde/intro/rappel.tex

@@ -0,0 +1,147 @@
+\begin{frame}
+  \frametitle{Les modèles de cohérences}
+
+  \begin{columns}
+    \column{0.6\textwidth}
+    \footnote{Perrin, \emph{Concurrence et cohérence dans les systèmes répartis}, 2017}
+    \resizebox{\columnwidth}{!}{
+      \includegraphics{images/carte_criteres.png}
+    }
+
+    \column{0.4\columnwidth}
+    \begin{block}{Les classes de cohérences}
+      2 Grandes familles :
+      \begin{itemize}
+        \item Cohérence Forte
+        \item Cohérence Faible :
+        \begin{itemize}
+          \item Localité d'état (SL)
+          \item Convergence (EC)
+          \item Validité (V)
+        \end{itemize}
+      \end{itemize}
+    \end{block}
+  \end{columns}
+\end{frame}
+
+\begin{frame}
+  \frametitle{Validité (V)}
+
+  \begin{block}{Définition}
+    Il existe, un ensemble cofini d'événement tel que pour chacun d'entre eux une linéarisation de toutes les opérations d'écriture les justifient. \\
+  \end{block}
+
+  \begin{columns}
+    \column{0.4\columnwidth}
+    \begin{tcolorbox}[colframe=green!50!black]
+      \input{schemas/validite_hc_1}
+    \end{tcolorbox}
+    \column{0.5\columnwidth}
+    \begin{math}
+      \begin{array}{ll}
+        E' = & \{r/(2,1)^\omega, r/(1,2)^\omega\}                             \\
+             & w(2) \bullet w(1) \bullet \textcolor{red}{r/(2,1)^\omega} \\
+             & w(1) \bullet w(2) \bullet \textcolor{red}{r/(1,2)^\omega} \\
+      \end{array}
+    \end{math}
+  \end{columns}
+
+  \begin{columns}
+    \column{0.4\columnwidth}
+    \begin{tcolorbox}[colframe=red!50!black]
+      \input{schemas/validite_hc_2}
+    \end{tcolorbox}
+    \column{0.5\columnwidth}
+    $E' = \{r/(0,1)^\omega, r/(1,2)^\omega\}$. \\
+    Il n'existe pas de linéarisation des opérations d'écritures qui justifie $r/(0,1)^\omega$.
+  \end{columns}
+\end{frame}
+
+\begin{frame}
+  \frametitle{Localité d'état}
+
+  \begin{block}{Définition}
+    Pour tout processus $p$, il existe une linéarisation contenant toutes les lectures pures de $p$. Respectant l'ordre local de ces lectures. \\
+  \end{block}
+
+  \begin{columns}
+    \column{0.4\columnwidth}
+    \begin{tcolorbox}[colframe=green!50!black]
+      \input{schemas/localiteetat_hc_1}
+    \end{tcolorbox}
+    \column{0.5\columnwidth}
+    \begin{math}
+      \begin{array}{l}
+        \textcolor{blue}{C_{p_0} = \{r/(0,0), r/(0,2)^\omega, w(2)\}}, \\
+        \textcolor{red}{C_{p_1} = \{r/(0,0), r/(0,1)^\omega, w(1)\}},  \\
+        \textcolor{blue}{r/(0,0) \bullet w(2) \bullet r/(0,2)^\omega}  \\
+        \textcolor{red}{r/(0,0) \bullet w(1) \bullet r/(0,1)^\omega}   \\
+      \end{array}
+    \end{math}
+  \end{columns}
+
+  \begin{columns}
+    \column{0.4\columnwidth}
+    \begin{tcolorbox}[colframe=red!50!black]
+      \input{schemas/localiteetat_hc_2}
+    \end{tcolorbox}
+    \column{0.5\columnwidth}
+    $E'_{p_0} = \{r/(0,0), r/(2,1)^\omega\},$ \newline
+    $r/(0,0) \bullet w(2) \bullet w(1) \bullet r/(2,1)^\omega$  \newline
+    $E'_{p_1} = \{r/(0,1), r/(2,1)^\omega\}$. \newline
+    Il n'existe pas de linéarisation de $p_1$ respectant la localité d'état.
+  \end{columns}
+\end{frame}
+
+\begin{frame}
+  \frametitle{Convergence (EC)}
+
+  \begin{block}{Définition}
+    Il existe un ensemble cofini d'événements dont chacun peut être justifié par un seul et même état. \\
+  \end{block}
+
+  \begin{columns}
+    \column{0.4\columnwidth}
+    \begin{tcolorbox}[colframe=green!50!black]
+      \input{schemas/convergence_hc_1}
+    \end{tcolorbox}
+    \column{0.5\columnwidth}
+    $E' = \{r/(1,2)^\omega, r/(1,2)^\omega\}$ \newline
+    $\delta = ((1,2), \emptyset)$ est un état possible justifiant $E'$.
+  \end{columns}
+
+  \begin{columns}
+    \column{0.4\columnwidth}
+    \begin{tcolorbox}[colframe=red!50!black]
+      \input{schemas/convergence_hc_2}
+    \end{tcolorbox}
+    \column{0.5\columnwidth}
+    $E' = \{r/(1,2)^\omega, r/(2,1)^\omega\}$. \newline
+    Il n'existe aucun état possible justifiant $E'$ puisque deux lectures infinies sont incohérentes.
+  \end{columns}
+\end{frame}
+
+\begin{frame}
+  \frametitle{Cohérence Causale}
+
+  \begin{columns}
+    \column{0.6\textwidth}
+    \resizebox{\columnwidth}{!}{
+      \includegraphics{images/carte_criteres.png}
+    }
+
+    \column{0.4\columnwidth}
+    \begin{block}{Les classes de la cohérence causale}
+      \begin{itemize}
+        \item \textbf{WCC}: Weak Causal Consistency (V)
+        \item \textbf{CCv}: Causal Convergence (V, EC)
+      \end{itemize}
+    \end{block}
+
+    On respecte les propriétés suivantes :
+    \begin{itemize}
+      \item Localité d'état (SL)
+      \item Convergence (EC)
+    \end{itemize}
+  \end{columns}
+\end{frame}

docs/presentations/LIS/vanderlinde/main.tex

@@ -0,0 +1,58 @@
+\documentclass{beamer}
+\usetheme{Boadilla}
+\usecolortheme{orchid}
+
+\usepackage[T1]{fontenc}
+\usepackage[utf8]{inputenc}
+\usepackage[french]{babel}
+\usepackage{stackengine}
+
+\addtobeamertemplate{navigation symbols}{}{%
+    \usebeamerfont{footline}%
+    \usebeamercolor[fg]{footline}%
+    \hspace{1em}%
+    \insertframenumber/\inserttotalframenumber
+}
+\usepackage{ulem}
+\usepackage{tkz-tab}
+\setbeamertemplate{blocks}[rounded]%
+[shadow=true]
+\AtBeginSection{%
+    \begin{frame}
+        \tableofcontents[sections=\value{section}]
+    \end{frame}
+}
+
+\usepackage{tikz}
+\usetikzlibrary{positioning}
+\usetikzlibrary{calc}
+\usetikzlibrary{arrows.meta}
+
+\usepackage{tcolorbox}
+
+\usepackage{chronosys}
+
+\title[bwconsistency]{Cohérence faible byzantine appliquée au cloud}
+\subtitle{Présentation intermédiaire: "Practical Client-side Replication: Weak Consistency Semantics for Insecure Settings"}
+\author[JOLY Amaury]{JOLY Amaury\\ \textbf{Encadrants :} GODARD Emmanuel, TRAVERS Corentin }
+% \\[2ex] \includegraphics[scale=0.1]{./img/amu.png}
+\institute[LIS, Scille]{LIS-LAB, Scille}
+\date{\today}
+
+\begin{document}
+
+\maketitle
+
+\begin{frame}{Table des matières}
+  \tableofcontents
+\end{frame}
+
+\section{Introduction}
+\input{intro/index.tex}
+
+\input{corps/index.tex}
+
+% \section{Les propriétés de la Cohérence Faible}
+% \input{wconsistence_properties/index.tex}
+
+\end{document}

docs/presentations/LIS/vanderlinde/schemas/convergence_hc_1.tex

@@ -0,0 +1,41 @@
+\resizebox{\columnwidth}{!}{
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$I(a)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,1)$};
+        \node[roundnode] (14) [right=35pt of 13] {};
+        \node[above] at (14.north) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+        \draw[arrow] (13) -- (14);
+
+        \node[roundnode] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$R/\emptyset$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(0,2)$};
+        \node[roundnode] (24) [right=35pt of 23] {};
+        \node[below] at (24.south) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+        \draw[arrow] (23) -- (24);
+
+        \draw (24) -- (14);
+
+        \draw[dashed] ($(14)!0.5!(13) + (0,1)$) -- ++(0, -2.9);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/convergence_hc_2.tex

@@ -0,0 +1,41 @@
+\resizebox{\columnwidth}{!}{
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$I(a)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,1)$};
+        \node[roundnode] (14) [right=35pt of 13] {};
+        \node[above] at (14.north) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+        \draw[arrow] (13) -- (14);
+
+        \node[roundnode] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$R/\emptyset$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(0,2)$};
+        \node[roundnode] (24) [right=35pt of 23] {};
+        \node[below] at (24.south) {$r/(2,1)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+        \draw[arrow] (23) -- (24);
+
+        \draw (24) -- (14);
+
+        \draw[dashed] ($(14)!0.5!(13) + (0,1)$) -- ++(0, -2.9);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/linearisation_atomicite_hc.tex

@@ -0,0 +1,26 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundedrectangle/.style={draw, rounded corners, rectangle, minimum height=10pt, minimum width=20pt},
+        invisible/.style={draw=none, fill=none},
+        ]
+
+        \node[invisible] (10) {};
+        \node[roundedrectangle, minimum width=150pt] (11) [right=100pt of 10] {$w_x(1)$};
+        \node[invisible] (12) [right=100pt of 11] {};
+
+        \node[invisible] (20) [below=15pt of 10] {};
+        \node[roundedrectangle, minimum width=50pt] (21) [right=25pt of 20] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (22) [right=75pt of 21] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (23) [right=75pt of 22] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (24) [below=15pt of 12] {};
+
+        \node[invisible] (30) [below=15pt of 20] {};
+        \node[roundedrectangle, minimum width=50pt] (31) [right=125pt of 30] {\textcolor{red}{$r/(1)$}};
+        \node[roundedrectangle, minimum width=50pt] (32) [right=40pt of 31] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (33) [below=15pt of 24] {};
+
+        \draw (10) -- (11) -- (12);
+        \draw (20) -- (21) -- (22) -- (23) -- (24);
+        \draw (30) -- (31) -- (32) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/linearisation_regularite_hc.tex

@@ -0,0 +1,26 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundedrectangle/.style={draw, rounded corners, rectangle, minimum height=10pt, minimum width=20pt},
+        invisible/.style={draw=none, fill=none},
+        ]
+
+        \node[invisible] (10) {};
+        \node[roundedrectangle, minimum width=150pt] (11) [right=100pt of 10] {$w_x(1)$};
+        \node[invisible] (12) [right=100pt of 11] {};
+
+        \node[invisible] (20) [below=15pt of 10] {};
+        \node[roundedrectangle, minimum width=50pt] (21) [right=25pt of 20] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (22) [right=75pt of 21] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (23) [right=75pt of 22] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (24) [below=15pt of 12] {};
+
+        \node[invisible] (30) [below=15pt of 20] {};
+        \node[roundedrectangle, minimum width=50pt] (31) [right=125pt of 30] {\textcolor{red}{$r/(1)$}};
+        \node[roundedrectangle, minimum width=50pt] (32) [right=40pt of 31] {\textcolor{blue}{$r/(0)$}};
+        \node[invisible] (33) [below=15pt of 24] {};
+
+        \draw (10) -- (11) -- (12);
+        \draw (20) -- (21) -- (22) -- (23) -- (24);
+        \draw (30) -- (31) -- (32) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/linearisation_surete_hc.tex

@@ -0,0 +1,26 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundedrectangle/.style={draw, rounded corners, rectangle, minimum height=10pt, minimum width=20pt},
+        invisible/.style={draw=none, fill=none},
+        ]
+
+        \node[invisible] (10) {};
+        \node[roundedrectangle, minimum width=150pt] (11) [right=100pt of 10] {$w_x(1)$};
+        \node[invisible] (12) [right=100pt of 11] {};
+
+        \node[invisible] (20) [below=15pt of 10] {};
+        \node[roundedrectangle, minimum width=50pt] (21) [right=25pt of 20] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (22) [right=75pt of 21] {\textcolor{blue}{$r/(0)$}};
+        \node[roundedrectangle, minimum width=50pt] (23) [right=75pt of 22] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (24) [below=15pt of 12] {};
+
+        \node[invisible] (30) [below=15pt of 20] {};
+        \node[roundedrectangle, minimum width=50pt] (31) [right=125pt of 30] {\textcolor{red!50!blue}{$r/(27)$}};
+        \node[roundedrectangle, minimum width=50pt] (32) [right=40pt of 31] {\textcolor{red}{$r/(1)$}};
+        \node[invisible] (33) [below=15pt of 24] {};
+
+        \draw (10) -- (11) -- (12);
+        \draw (20) -- (21) -- (22) -- (23) -- (24);
+        \draw (30) -- (31) -- (32) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/localiteetat_hc_1.tex

@@ -0,0 +1,34 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode, draw=red, fill=red] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode, draw=blue, fill=blue] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,0)$};
+        \node[roundnode, draw=blue, fill=blue] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode, draw=blue, fill=blue] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode, draw=red, fill=red] (22) [right=of 21] {};
+        \node[below] at (22.south) {$r/(0,0)$};
+        \node[roundnode, draw=red, fill=red] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(0,1)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+
+        \draw[message] (11) -- ($(22)!0.5!(23)$);
+        \draw[message] (21) -- ($(12)!0.5!(13)$);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/localiteetat_hc_2.tex

@@ -0,0 +1,32 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,0)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$r/(0,1)$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(2,1)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/validite_hc_1.tex

@@ -0,0 +1,31 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,1)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(2,1)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode] (21) [below=10pt of 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$r/(0,2)$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/validite_hc_2.tex

@@ -0,0 +1,31 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[left] at (11.west) {$p_0$};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,1)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(0,1)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode] (21) [below=10ptof 11] {};
+        \node[left] at (21.west) {$p_1$};
+        \node[below] at (21.south) {$w(2)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[below] at (22.south) {$r/(0,2)$};
+        \node[roundnode] (23) [right=of 22] {};
+        \node[below] at (23.south) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (21) -- (22);
+        \draw[arrow] (22) -- (23);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/wcc_hc_1.tex

@@ -0,0 +1,42 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode, color=red] (11) {};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode, color=red!50] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(0,1)$};
+        \node[roundnode, color=red!25] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(3,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode, color=green!75!black] (21) [below=20pt of 11] {};
+        \node[left] at (21.west) {$r/(3,1)$};
+        \node[roundnode, color=green!95!black] (22) [right=of 21] {};
+        \node[right] at (22.east) {$w(2)$};
+
+        \draw[arrow] (21) -- (22);
+
+        \node[roundnode, color=blue] (31) [below=20pt of 21] {};
+        \node[below] at (31.south) {$w(3)$};
+        \node[roundnode, color=blue!50] (32) [right=of 31] {};
+        \node[below] at (32.south) {$r/(3,1)$};
+        \node[roundnode, color=blue!25] (33) [right=of 32] {};
+        \node[below] at (33.south) {$r/(3,2)^\omega$};
+
+        \draw[arrow] (31) -- (32);
+        \draw[arrow] (32) -- (33);
+
+        \draw[message] (11) -- (21);
+        \draw[message] (31) -- (21);
+        \draw[message] (21) -- (32);
+        \draw[message] (22) -- (13);
+        \draw[message] (22) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/wcc_hc_2.tex

@@ -0,0 +1,29 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode] (11) {};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(2,1)$};
+        \node[roundnode] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(2,1)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode] (21) [below=20pt of 11] {};
+        \node[left] at (21.west) {$r/(0,1)$};
+        \node[roundnode] (22) [right=of 21] {};
+        \node[right] at (22.east) {$w(2)$};
+
+        \draw[arrow] (21) -- (22);
+
+        \draw[message] (11) -- (21);
+        \draw[message] (22) -- (12);
+    \end{tikzpicture}
+}

docs/presentations/LIS/vanderlinde/schemas/wcc_hc_3.tex

@@ -0,0 +1,41 @@
+\resizebox{\columnwidth}{!}{%
+    \begin{tikzpicture}[
+        roundnode/.style={circle, draw=black, fill=black, very thick, minimum size=1pt,},
+        ignorednode/.style={circle, draw=black!20, fill=black!20, very thick, minimum size=1pt,},
+        arrow/.style={|->, thick,},
+        message/.style={->, blue!50, dashed, -{Circle[length=4pt,]}},
+        ]
+
+        \node[roundnode, color=red] (11) {};
+        \node[above] at (11.north) {$w(1)$};
+        \node[roundnode, color=red!50] (12) [right=of 11] {};
+        \node[above] at (12.north) {$r/(3,1)$};
+        \node[roundnode, color=red!25] (13) [right=of 12] {};
+        \node[above] at (13.north) {$r/(1,2)^\omega$};
+
+        \draw[arrow] (11) -- (12);
+        \draw[arrow] (12) -- (13);
+
+        \node[roundnode, color=green!75!black] (21) [below=20pt of 11] {};
+        \node[left] at (21.west) {$r/(0,0)$};
+        \node[roundnode, color=green!95!black] (22) [right=of 21] {};
+        \node[right] at (22.east) {$w(2)$};
+
+        \draw[arrow] (21) -- (22);
+
+        \node[roundnode, color=blue] (31) [below=20pt of 21] {};
+        \node[below] at (31.south) {$w(3)$};
+        \node[roundnode, color=blue!50] (32) [right=of 31] {};
+        \node[below] at (32.south) {$r/(1,3)$};
+        \node[roundnode, color=blue!25] (33) [right=of 32] {};
+        \node[below] at (33.south) {$r/(3,2)^\omega$};
+
+        \draw[arrow] (31) -- (32);
+        \draw[arrow] (32) -- (33);
+
+        \draw[message] (11) -- (31);
+        \draw[message] (31) -- (12);
+        \draw[message] (22) -- (13);
+        \draw[message] (22) -- (33);
+    \end{tikzpicture}
+}

docs/presentations/scille/seminaire_ete_2023/box.css

@@ -0,0 +1,64 @@
+.reveal .colourbox, .reveal .colorbox {
+	padding-left: 3%;
+	padding-right: 3%;
+	padding-top: 0.8ex; 
+	padding-bottom: 1ex;
+	margin-bottom: 15px;
+	width: 100%;
+	color: #000000;
+	text-shadow: none;
+	text-align: left;
+	background-color: #fff6ac;
+	border: none;
+	border-radius: 0.5em;
+	box-shadow: 8px 8px 4px 2px rgba(0, 0, 0, 0.4);
+}
+
+.reveal .box {
+	width: 100% auto;
+	margin-bottom: 15px;
+	margin-top: 1ex;
+	line-height: 1.2;
+	padding: 0;
+	text-align: center;
+	overflow: auto;
+	text-align: left;
+	border-top-right-radius: 0.5em;
+	border-bottom-right-radius: 0.5em;
+	box-shadow: 8px 8px 4px 2px rgba(0, 0, 0, 0.4);
+}
+
+.reveal .box .title,
+.reveal .box .content {
+	padding-left: 3%;
+	padding-right: 3%;
+	border: #000 1px solid;
+}
+
+.reveal .box .title {
+	padding-top: 0.4ex; 
+	padding-bottom: 0.5ex;
+	color: #ffffff;
+	text-shadow: 1px 1px 0 #000;
+	background-color: #421e00;
+	border-bottom: none;
+	border-top-right-radius: 0.5em;
+	border-top-left-radius: 0.5em;
+}
+
+.reveal .box .content {
+	padding-top: 0.8ex; 
+	padding-bottom: 1ex;
+	color: #000000;
+	text-shadow: none;
+	background-color: #fff6ac;
+	border-bottom-right-radius: 0.5em;
+	border-bottom-left-radius: 0.5em;
+
+    font-size: .75em;
+}
+
+.reveal .box .content ul li {
+    padding: 0px 0px;
+    list-style: symbols();
+}

docs/presentations/scille/seminaire_ete_2023/main.md

@@ -0,0 +1,135 @@
+
+<link rel="stylesheet" href="./sunblind.css">
+<!-- <link rel="stylesheet" href="./box.css"> -->
+
+# "Event Horizon": Lot 2 21/06/2023
+### JOLY Amaury (Laboratoire d'Informatique et Système, Parsec)
+### __Encadrants:__ Emmanuel GODARD, Corentin TRAVERS (Equipe Algorithmique Distribuée)
+
+---
+
+# Rappel des objectifs
+
+--
+
+## Pour Parsec
+
+__Lot 2 :__ Ajout à Parsec d'un outil d'édition collaborative.
+
+Dans approche visant à maximiser les performances (latence et interactivité) et la résilience.
+
+--
+
+## Pour le LIS
+
+Produire de la recherche sur la cohérence faible en milieu byzantin.
+
+--
+
+## La synthèse des deux
+
+1. Faire un état de l'art des solutions existantes.
+    - Prendre des décisions sur les choix techniques à adopter.
+2. Recherche d'un compromis algorithmique __résilience__/__intéractivité__.
+3. Réaliser un produit innovant dans sa gestion de la cohérence.
+    - Chercher une valeur ajoutée pour l'utilisateur.
+
+---
+
+# Mon travail depuis avril
+## Quelques définitions
+
+--
+
+## Quelques définitions
+
+__Systèmes répartis :__  
+Système composé d'un ensemble d'acteur interconnecté réalisant une tâche commune.
+
+<img src="./img/reparti.png" width="400"/>
+
+--
+
+## Quelques définitions
+
+__Cohérence dans un système reparti:__  
+Étude du comportement des données dans un système reparti d'un point de vue observateur.
+
+__Cohérence forte :__  
+Comportement attendu dans le cas d'une exécution à un seul acteur.
+
+---
+
+# Mon travail depuis avril
+## État de l'art
+
+
+--
+
+## État de l'art
+
+- Cohérence dans les systèmes répartis.
+  - Lamports (1970)
+  - Perrin : Concurrence et Cohérence des Systèmes répartis (2017)
+  
+---
+<img src="./img/perrin.png" alt="couverture \'Consistence et Cohérence des Systèmes réparties' M. Perrin" width="200"/>
+
+
+--
+
+## État de l'art
+
+### Un (très) rapide résumé
+
+<img src="./img/cartographie_simplifie.png" alt="cartographie des critères de cohérences" height="250"/>
+
+- Les critères de cohérences s'articulent autour de 3 propriétés élémentaires.
+- La conjonction des 3 représente le comportement d'un programme séquentiel.
+- Nous cherchons un compromis pour maximiser l'interactivité du produit
+
+
+--
+
+## État de l'art
+
+### Un (très) rapide résumé
+
+- Inventaire des différentes solutions existantes.
+  - Peu de littérature.
+  - Pas de taxonomie consensuelle, travail de classification 
+
+- Peu de réflexions sur les potentiels fautes byzantines induites par la (les ?) cohérences faibles.
+
+---
+
+# La suite
+
+--
+
+## La liste des tâches
+
+- [ ] Réaliser l'état de l'art
+  - [x] Gestion de la cohérence dans les systèmes répartis.
+  - [ ] Faire l'inventaire des solutions existantes. (BFT weak consistency).
+    - [x] Lister les solutions algorithmiques dans la littérature.
+    - [ ] S'intéresser aux solutions open-source (e.g.: etherpad)
+    - [ ] Classer les solutions.
+- [ ] Produire/adapter un algorithme dans une situation de référence (à déterminer).
+    - [ ] Formaliser les besoins du produit.
+    - [ ] Essayer de les satisfaire.
+- [ ] Réaliser un PoC.
+
+
+--
+
+## Pour les mois à venir
+
+Je vous propose une réunion en distanciel (~2h) pour :
+1. Vous présenter l'état de l'art.
+2. Placer le produit suivant ces contraintes.
+
+---
+
+# Merci !
+<img src="./img/cartographie.png" alt="cartographie des critères de cohérences" height="450"/>

docs/presentations/scille/seminaire_ete_2023/metropolis.css

@@ -0,0 +1,340 @@
+/**
+ * A simple theme for reveal.js presentations, derived from serif.css 
+ * It's in the spirit of the Metropolis theme for beamer https://github.com/matze/mtheme
+ *
+ * This theme is Copyright (C) 2016 Vince Hodges, http://sourdoughlabs.com - it is MIT licensed.
+ */
+
+@import url('https://fonts.googleapis.com/css?family=Fira+Sans');
+
+.reveal a {
+    line-height: 1.3em; }
+
+/*********************************************
+ * GLOBAL STYLES
+ *********************************************/
+body {
+    background: #f1f1f1;
+    background-color: #f1f1f1; }
+
+body.dark {
+    background: #33474b;
+    background-color: #33474b; }
+    
+body.dark .reveal {
+    color:#f1f1f1;
+}
+
+body.dark .reveal h1,
+body.dark .reveal h2,
+body.dark .reveal h3,
+body.dark .reveal h4,
+body.dark .reveal h5,
+body.dark .reveal h6 {
+    color:#f1f1f1;
+}
+
+.reveal {
+    font-family: "Fira Sans";
+    font-size: 32px;
+    font-weight: normal;
+    color: #33474b; }
+
+::selection {
+    color: #fff;
+    background: #26351C;
+    text-shadow: none; }
+
+.reveal .slides {
+    text-align:left;
+}
+
+.reveal .slides > section,
+.reveal .slides > section > section {
+    line-height: 1.2;
+    font-weight: inherit; }
+
+/*********************************************
+ * HEADERS
+ *********************************************/
+.reveal h1,
+.reveal h2,
+.reveal h3,
+.reveal h4,
+.reveal h5,
+.reveal h6 {
+    margin: 0 0 20px 0;
+    color: #33474b;
+    font-family: "Fira Sans";
+    font-weight: normal;
+    line-height: 1;
+    letter-spacing: normal;
+    text-transform: none;
+    text-shadow: none;
+    word-wrap: break-word; }
+
+.reveal h1 {
+    font-size: 1.77em; }
+
+.reveal h2 {
+    font-size: 1.30em; }
+
+.reveal h3 {
+    font-size: .95em; }
+
+.reveal h4 {
+    font-size: .75em; }
+
+.reveal h1 {
+    text-shadow: none; }
+
+h1.subtitle {
+    font-size: 1em;
+    padding-bottom:15px;
+    border-bottom: 2px solid #EB811B;
+}
+
+h2.author, h3.date {
+    font-size: .6em;
+}
+
+h1.title {
+    font-variant: small-caps;
+}
+
+.level2 h1 {
+    font-size:1.57em;
+    font-variant: small-caps;
+    text-transform: lowercase;
+}
+
+.titleslide h1 {
+    font-variant: small-caps;
+    font-size:1.67em;
+    margin-left:25px;
+    margin-right:25px;
+    padding-bottom: 10px;
+    border-bottom: 2px solid #EB811B;
+}
+
+
+/*********************************************
+ * OTHER
+ *********************************************/
+.reveal p {
+    margin: 20px 0;
+    line-height: 1.3; }
+
+/* Ensure certain elements are never larger than the slide itself */
+.reveal img,
+.reveal video,
+.reveal iframe {
+    max-width: 95%;
+    max-height: 95%; }
+
+.reveal strong,
+.reveal b {
+    font-weight: bold; }
+
+.reveal em {
+    font-style: italic; }
+
+.reveal ol,
+.reveal dl,
+.reveal ul {
+    display: inline-block;
+    text-align: left;
+    margin: 0 0 0 1em; }
+
+.reveal ol {
+    list-style-type: decimal; }
+
+.reveal ul {
+    list-style-type: disc; }
+
+.reveal ul ul {
+    list-style-type: square; }
+
+.reveal ul ul ul {
+    list-style-type: circle; }
+
+.reveal ul ul,
+.reveal ul ol,
+.reveal ol ol,
+.reveal ol ul {
+    display: block;
+    margin-left: 40px; }
+
+.reveal dt {
+    font-weight: bold; }
+
+.reveal dd {
+    margin-left: 40px; }
+
+.reveal q,
+.reveal blockquote {
+    quotes: none; }
+
+.reveal blockquote {
+    display: block;
+    position: relative;
+    width: 70%;
+    margin: 20px auto;
+    padding: 5px;
+    font-style: italic;
+    background: rgba(255, 255, 255, 0.05);
+    box-shadow: 0px 0px 2px rgba(0, 0, 0, 0.2); }
+
+.reveal blockquote p:first-child,
+.reveal blockquote p:last-child {
+    display: inline-block; }
+
+.reveal q {
+    font-style: italic; }
+
+.reveal pre {
+    display: block;
+    position: relative;
+    width: 90%;
+    margin: 20px auto;
+    text-align: left;
+    font-size: 0.55em;
+    font-family: monospace;
+    line-height: 1.2em;
+    word-wrap: break-word;
+    box-shadow: 0px 0px 6px rgba(0, 0, 0, 0.3); }
+
+.reveal code {
+    font-family: monospace; }
+
+.reveal pre code {
+    display: block;
+    padding: 5px;
+    overflow: auto;
+    max-height: 400px;
+    word-wrap: normal; }
+
+.reveal table {
+    margin: auto;
+    border-collapse: collapse;
+    border-spacing: 0; }
+
+.reveal table th {
+    font-weight: bold; }
+
+.reveal table th,
+.reveal table td {
+    text-align: left;
+    padding: 0.2em 0.5em 0.2em 0.5em;
+    border-bottom: 1px solid; }
+
+.reveal table th[align="center"],
+.reveal table td[align="center"] {
+    text-align: center; }
+
+.reveal table th[align="right"],
+.reveal table td[align="right"] {
+    text-align: right; }
+
+.reveal table tr:last-child td {
+    border-bottom: none; }
+
+.reveal sup {
+    vertical-align: super; }
+
+.reveal sub {
+    vertical-align: sub; }
+
+.reveal small {
+    display: inline-block;
+    font-size: 0.6em;
+    line-height: 1.2em;
+    vertical-align: top; }
+
+.reveal small * {
+    vertical-align: top; }
+
+/*********************************************
+ * LINKS
+ *********************************************/
+.reveal a {
+    color: #51483D;
+    text-decoration: none;
+    -webkit-transition: color 0.15s ease;
+    -moz-transition: color 0.15s ease;
+    transition: color 0.15s ease; }
+
+.reveal a:hover {
+    color: #8b7c69;
+    text-shadow: none;
+    border: none; }
+
+.reveal .roll span:after {
+    color: #fff;
+    background: #25211c; }
+
+/*********************************************
+ * IMAGES
+ *********************************************/
+.reveal section img {
+    margin: 15px 0px;
+    background: rgba(255, 255, 255, 0.12);
+    border: 4px solid #000;
+    box-shadow: 0 0 10px rgba(0, 0, 0, 0.15); }
+
+.reveal section img.plain {
+    border: 0;
+    box-shadow: none; }
+
+.reveal a img {
+    -webkit-transition: all 0.15s linear;
+    -moz-transition: all 0.15s linear;
+    transition: all 0.15s linear; }
+
+.reveal a:hover img {
+    background: rgba(255, 255, 255, 0.2);
+    border-color: #51483D;
+    box-shadow: 0 0 20px rgba(0, 0, 0, 0.55); }
+
+/*********************************************
+ * NAVIGATION CONTROLS
+ *********************************************/
+.reveal .controls .navigate-left,
+.reveal .controls .navigate-left.enabled {
+    border-right-color: #51483D; }
+
+.reveal .controls .navigate-right,
+.reveal .controls .navigate-right.enabled {
+    border-left-color: #51483D; }
+
+.reveal .controls .navigate-up,
+.reveal .controls .navigate-up.enabled {
+    border-bottom-color: #51483D; }
+
+.reveal .controls .navigate-down,
+.reveal .controls .navigate-down.enabled {
+    border-top-color: #51483D; }
+
+.reveal .controls .navigate-left.enabled:hover {
+    border-right-color: #8b7c69; }
+
+.reveal .controls .navigate-right.enabled:hover {
+    border-left-color: #8b7c69; }
+
+.reveal .controls .navigate-up.enabled:hover {
+    border-bottom-color: #8b7c69; }
+
+.reveal .controls .navigate-down.enabled:hover {
+    border-top-color: #8b7c69; }
+
+/*********************************************
+ * PROGRESS BAR
+ *********************************************/
+.reveal .progress {
+    background: rgba(235, 129, 27, .4); }
+
+.reveal .progress span {
+    background: rgba(235, 129, 27, 1);
+    -webkit-transition: width 800ms cubic-bezier(0.26, 0.86, 0.44, 0.985);
+    -moz-transition: width 800ms cubic-bezier(0.26, 0.86, 0.44, 0.985);
+    transition: width 800ms cubic-bezier(0.26, 0.86, 0.44, 0.985); }

docs/presentations/scille/seminaire_ete_2023/sunblind.css

@@ -0,0 +1,340 @@
+/**
+
+  [ sunblind ]
+
+  A blindingly sunny theme for Reveal.js with Lora + Leto fonts and a colorful border.
+  By Josh Dzielak, https://dzello.com/, License MIT
+
+  The bold border is optional and requires some HTML. To use it:
+
+  1. Add 4 divs to your HTML page:
+    <div class="line top"></div>
+    <div class="line bottom"></div>
+    <div class="line left"></div>
+    <div class="line right"></div>
+
+  2. Set { margin: 0.2 } in the Reveal.js initializer to make sure
+  your presentation content doesn't collide with the frame.
+
+  Like the theme but don't like the colors? Don't fret. Just change
+  $borderColor and/or $linkColor below to something else and rebuild.
+
+  Or if you don't want to rebuild the theme just override the .line background
+  property with some CSS:
+
+  .line {
+    background: <new-color>;
+  }
+
+*/
+@import url(https://fonts.googleapis.com/css?family=Lato:300,700);
+@import url(https://fonts.googleapis.com/css?family=Lora:700);
+section.has-light-background, section.has-light-background h1, section.has-light-background h2, section.has-light-background h3, section.has-light-background h4, section.has-light-background h5, section.has-light-background h6 {
+  color: #141414; }
+
+.reveal .controls {
+  right: 50px;
+  bottom: 50px; }
+
+.line {
+  content: '';
+  position: fixed;
+  background: #f6f195;
+  z-index: 105; }
+  .line.top {
+    left: 0;
+    top: 0;
+    width: 100%;
+    height: 30px; }
+    @media (max-width: 840px) {
+      .line.top {
+        height: 15px; } }
+  .line.bottom {
+    left: 0;
+    top: auto;
+    bottom: 0;
+    width: 100%;
+    height: 30px; }
+    @media (max-width: 840px) {
+      .line.bottom {
+        height: 15px; } }
+  .line.left {
+    left: 0;
+    top: 0;
+    width: 30px;
+    height: 200%; }
+    @media (max-width: 840px) {
+      .line.left {
+        width: 15px; } }
+  .line.right {
+    left: auto;
+    right: 0;
+    top: 0;
+    width: 30px;
+    height: 200%; }
+    @media (max-width: 840px) {
+      .line.right {
+        width: 15px; } }
+
+.reveal.has-dark-background .line {
+  display: none; }
+
+/*********************************************
+ * GLOBAL STYLES
+ *********************************************/
+body {
+  background: #fff;
+  background-color: #fff; }
+
+.reveal {
+  font-family: "Lato", serif;
+  font-size: 32px;
+  font-weight: normal;
+  color: #363636; }
+
+::selection {
+  color: #fff;
+  background: #ffc0d5;
+  text-shadow: none; }
+
+::-moz-selection {
+  color: #fff;
+  background: #ffc0d5;
+  text-shadow: none; }
+
+.reveal .slides > section,
+.reveal .slides > section > section {
+  line-height: 1.3;
+  font-weight: inherit; }
+
+/*********************************************
+ * HEADERS
+ *********************************************/
+.reveal h1,
+.reveal h2,
+.reveal h3,
+.reveal h4,
+.reveal h5,
+.reveal h6 {
+  margin: 0 0 20px 0;
+  color: #141414;
+  font-family: "Lora", sans-serif;
+  font-weight: 700;
+  line-height: 1.2;
+  letter-spacing: normal;
+  text-transform: uppercase;
+  text-shadow: none;
+  word-wrap: break-word; }
+
+.reveal h1 {
+  font-size: 1.77em; }
+
+.reveal h2 {
+  font-size: 1.3em; }
+
+.reveal h3 {
+  font-size: .95em; }
+
+.reveal h4 {
+  font-size: .75em; }
+
+.reveal h1 {
+  text-shadow: none; }
+
+/*********************************************
+ * OTHER
+ *********************************************/
+.reveal p {
+  margin: 20px 0;
+  line-height: 1.3; }
+
+/* Ensure certain elements are never larger than the slide itself */
+.reveal img,
+.reveal video,
+.reveal iframe {
+  max-width: 95%;
+  max-height: 95%; }
+
+.reveal strong,
+.reveal b {
+  font-weight: bold; }
+
+.reveal em {
+  font-style: italic; }
+
+.reveal ol,
+.reveal dl,
+.reveal ul {
+  display: inline-block;
+  text-align: left;
+  margin: 0 0 0 1em; }
+
+.reveal ol {
+  list-style-type: decimal; }
+
+.reveal ul {
+  list-style-type: disc; }
+
+.reveal ul ul {
+  list-style-type: square; }
+
+.reveal ul ul ul {
+  list-style-type: circle; }
+
+.reveal ul ul,
+.reveal ul ol,
+.reveal ol ol,
+.reveal ol ul {
+  display: block;
+  margin-left: 40px; }
+
+.reveal dt {
+  font-weight: bold; }
+
+.reveal dd {
+  margin-left: 40px; }
+
+.reveal blockquote {
+  display: block;
+  position: relative;
+  width: 70%;
+  margin: 20px auto;
+  padding: 5px;
+  font-style: italic;
+  background: rgba(255, 255, 255, 0.05);
+  box-shadow: 0px 0px 2px rgba(0, 0, 0, 0.2); }
+
+.reveal blockquote p:first-child,
+.reveal blockquote p:last-child {
+  display: inline-block; }
+
+.reveal q {
+  font-style: italic; }
+
+.reveal pre {
+  display: block;
+  position: relative;
+  width: 90%;
+  margin: 20px auto;
+  text-align: left;
+  font-size: 0.55em;
+  font-family: monospace;
+  line-height: 1.2em;
+  word-wrap: break-word;
+  box-shadow: 0px 0px 6px rgba(0, 0, 0, 0.3); }
+
+.reveal code {
+  font-family: monospace;
+  text-transform: none; }
+
+.reveal pre code {
+  display: block;
+  padding: 5px;
+  overflow: auto;
+  max-height: 400px;
+  word-wrap: normal; }
+
+.reveal table {
+  margin: auto;
+  border-collapse: collapse;
+  border-spacing: 0; }
+
+.reveal table th {
+  font-weight: bold; }
+
+.reveal table th,
+.reveal table td {
+  text-align: left;
+  padding: 0.2em 0.5em 0.2em 0.5em;
+  border-bottom: 1px solid; }
+
+.reveal table th[align="center"],
+.reveal table td[align="center"] {
+  text-align: center; }
+
+.reveal table th[align="right"],
+.reveal table td[align="right"] {
+  text-align: right; }
+
+.reveal table tbody tr:last-child th,
+.reveal table tbody tr:last-child td {
+  border-bottom: none; }
+
+.reveal sup {
+  vertical-align: super; }
+
+.reveal sub {
+  vertical-align: sub; }
+
+.reveal small {
+  display: inline-block;
+  font-size: 0.6em;
+  line-height: 1.2em;
+  vertical-align: top; }
+
+.reveal small * {
+  vertical-align: top; }
+
+/*********************************************
+ * LINKS
+ *********************************************/
+.reveal a {
+  color: #FF4081;
+  text-decoration: none;
+  -webkit-transition: color .15s ease;
+  -moz-transition: color .15s ease;
+  transition: color .15s ease; }
+
+.reveal a:hover {
+  color: #ff8db3;
+  text-shadow: none;
+  border: none; }
+
+.reveal .roll span:after {
+  color: #fff;
+  background: #f30053; }
+
+/*********************************************
+ * IMAGES
+ *********************************************/
+.reveal section img {
+  margin: 15px 0px;
+  background: rgba(255, 255, 255, 0.12);
+  border: 4px solid #363636;
+  box-shadow: 0 0 10px rgba(0, 0, 0, 0.15); }
+
+.reveal section img.plain {
+  border: 0;
+  box-shadow: none; }
+
+.reveal a img {
+  -webkit-transition: all .15s linear;
+  -moz-transition: all .15s linear;
+  transition: all .15s linear; }
+
+.reveal a:hover img {
+  background: rgba(255, 255, 255, 0.2);
+  border-color: #FF4081;
+  box-shadow: 0 0 20px rgba(0, 0, 0, 0.55); }
+
+/*********************************************
+ * NAVIGATION CONTROLS
+ *********************************************/
+.reveal .controls {
+  color: #FF4081; }
+
+/*********************************************
+ * PROGRESS BAR
+ *********************************************/
+.reveal .progress {
+  background: rgba(0, 0, 0, 0.2);
+  color: #FF4081; }
+
+.reveal .progress span {
+  -webkit-transition: width 800ms cubic-bezier(0.26, 0.86, 0.44, 0.985);
+  -moz-transition: width 800ms cubic-bezier(0.26, 0.86, 0.44, 0.985);
+  transition: width 800ms cubic-bezier(0.26, 0.86, 0.44, 0.985); }
+
+.reveal .progress {
+  z-index: 1000;
+  color: #ece11f; }

recherches/Stage.bib

@@ -0,0 +1,405 @@
+
+@article{van_der_linde_practical_2020,
+	title = {Practical client-side replication: weak consistency semantics for insecure settings},
+	volume = {13},
+	issn = {2150-8097},
+	url = {https://dl.acm.org/doi/10.14778/3407790.3407847},
+	doi = {10.14778/3407790.3407847},
+	shorttitle = {Practical client-side replication},
+	abstract = {Client-side replication and direct client-to-client synchronization can be used to create highly available, low-latency interactive applications. Causal consistency, the strongest available consistency model under network partitions, is an attractive consistency model for these applications.},
+	pages = {2590--2605},
+	number = {12},
+	journaltitle = {Proceedings of the {VLDB} Endowment},
+	shortjournal = {Proc. {VLDB} Endow.},
+	author = {Van Der Linde, Albert and Leitão, João and Preguiça, Nuno},
+	urldate = {2023-06-06},
+	date = {2020-08},
+	langid = {english},
+	annotation = {Fiche Lecture
+Résumé:
+Le papier spécifie une amélioration de la cohérence causale, rajoutant des propriétés en renforçant la sécurité. Ils comparent ensuite différentes implémentations de leurs solutions en axant sur le besoin d'une faible latence pour privilégier l'interactivité.
+Plan:
+
+
+ Présente les attaques possibles sur la cohérence causale. \$3
+
+
+ Définissent les propriétés d'une cohérence causale sécurisée répondant aux attaques. \$4
+
+
+Définit de nouvelles classes de cohérence étendant la cohérence causale. \$5
+
+
+Définit des algorithmes pour implémenter ces classes de cohérence. \$5
+
+
+Présente des résultats de performance de ces algorithmes. \$6
+
+
+Détails du document
+Types d'attaques
+
+
+Tempering: un nœud soumet une opération pour anticiper une opération en attente qui n'a pas encore été exécutée par le système.
+
+
+Omitting dependencies: un nœud n'utilise qu'un sous-ensemble des opérations dans la dépendance. Il sera en mesure de soumettre une tâche concurrente au système.
+
+
+Unseen dependencies (également appelé add): un nœud soumet une opération qui dépend d'une opération qu'il n'a pas vue. Il permet à l'attaquant d'anticiper une opération. (C'est différent du tempering car dans ce cas l'opération n'existe pas encore).
+
+
+Combining omitting and unseen: un nœud peut omettre une dépendance et soumettre une opération qui dépend d'une opération qu'il n'a pas vue.
+
+
+Sibbling generation: créer deux opérations différentes avec le même id. L'attaquant pourrait créer une divergence permanente entre les nœuds.
+
+
+Propriétés d'une cohérence causale sécurisée
+
+
+Immutable History: Chaque opération est envoyée avec son passé causal à chaque nœud valide. (Contrecarre le tempering)
+
+
+No Future Dependencies Chaque opération est envoyée avec son état de connaissance de l'état des nœuds du système. (Contrecarre l'unseen dependencies puisque l'opération sera considérée par l'ensemble du système comme "en retard" et sera donc ignorée)
+
+
+Causal Execution: Toute opération \$o\_i\$ appartenant au passé causal d'une opération \$o\$ doit être sérialisable t.q. : \$o\_i {\textless} o\$. (Force une sorte de synchronisation entre les nœuds)
+
+
+Eventual Sibling Detection: Chaque opération doit être considérée comme une faute éventuelle et doit donc avoir la possibilité d'être révoqué. La révocation ne peut se produire qu'après l'exécution de l'opération. (Assure que si deux opérations sont créées avec un même identifiant et crée une divergence, alors les nœuds auront toujours un moyen de retourner à un état convergent. Contrecarre **en partie** le sibling generation)
+
+
+Limitted Omission: 
+
+
+{\textless}!-- {OLD}
+\# Practical Client-side Replication: Weak Consistency Semantics for Insecure Settings
+\#\# Authors: van der Linde, Leitao, Preguica
+\#\# Definition
+causal consistency: model enforcing clients to observe a state that respects the causal order of operations. (this is the case for decentralized and peer to peer systems)
+Attacks on causal consistency:
+- Tempering: a node submit an operation to anticipate a pending operation actually not yet executed by the system.
+- Omitting dependencies: a node used only a subset of the operations in the dependency. He will be able to submit a concurrent task to the system.
+- Unseen dependencies (also called add): a node submit an operation that depends on an operation that he didn't see. It can be usefull for the attacker to anticipate the operation. (This is different from tempering because in this case the operation does not exist yet).
+- Combining omitting and unseen: a node can omit a dependency and submit an operation that depends on an operation that he didn't see.
+- Sibbling generation: creating two differents operations with the same id. The attacker could create a permanent state divergence between the nodes.
+\#\# Summary
+\#\#\# Solutions used in the paper
+\#\#\#\# Secure Causal Consistency
+Autors defined the properties of a secure causal consistency: Immutable History, No Future Dependencies, Causal Executions, Limitted Omission, and Eventual Sibling Detection.
+The algorithms they propose used the following solutions for each property:
+- Immutable History: The nodes sign the operations and the dependencies. The nodes can't temper the history because they can't sign the operation.
+- No Future Dependencies: Each operations includes a hash of all direct causal dependencies. The nodes can't omit dependencies because they can't sign the operation.
+- Causal Executions: The nodes need to verify, before executing an operation, that all the dependencies are executed.
+- Limitted Omission: It's by design impossible due to the metadata (hash of the dependencies).
+- Eventual Sibling Detection: Many mechanism are used:
+  - a node is able to detect when two operations with the same id are send from differents paths.
+  - a node is able than the hash of the dependencies is different with the hash provide by the operation.
+  - the nodes are comparing the dependencies of the operation between them. If they are different, they are able to detect the sibbling generation.
+\#\#\#\# Secure Strict Causal Consistency
+The Secure Strict Causas Consistency is a variant of the Secure Causal Consistency who is using a trusted service. Such as the enclave in Intel {SGX}. Thus the usage of a hash of the dependencies is unnecessary.
+An issue of this solution is the cost of the connection to the trusted service. A possible attack would be to connect and disconnect a lot of time of the trusted service to make the system slow.
+This sollution was not explored in the paper due to this issue. --{\textgreater}
+
+},
+	file = {Van Der Linde et al. - 2020 - Practical client-side replication weak consistenc.pdf:/home/amaury/Zotero/storage/5TJ3SA56/Van Der Linde et al. - 2020 - Practical client-side replication weak consistenc.pdf:application/pdf},
+}
+
+@book{perrin_concurrence_2017,
+	title = {Concurrence et cohérence dans les systèmes répartis},
+	isbn = {978-1-78405-295-9},
+	abstract = {La société moderne est de plus en plus dominée par la société virtuelle, le nombre d’internautes dans le monde ayant dépassé les trois milliards en 2015. A la différence de leurs homologues séquentiels, les systèmes répartis sont beaucoup plus difficiles à concevoir, et sont donc sujets à de nombreux problèmes.La cohérence séquentielle fournit la même vue globale à tous les utilisateurs, mais le confort d\&\#39;utilisation qu\&\#39;elle apporte est trop coûteux, voire impossible, à mettre en oeuvre à grande échelle. Concurrence et cohérence dans les systèmes répartis examine les meilleures façons de spécifier les objets que l’on peut tout de même implémenter dans ces systèmes.Cet ouvrage explore la zone grise des systèmes répartis et dresse une carte des critères de cohérence faible, identifiant plusieurs familles et démontrant comment elles peuvent s’intégrer dans un langage de programmation.},
+	pagetotal = {194},
+	publisher = {{ISTE} Group},
+	author = {Perrin, Matthieu},
+	date = {2017-09-01},
+	langid = {french},
+	note = {Google-Books-{ID}: 6DRlDwAAQBAJ},
+	annotation = {Fiche Lecture
+Réflexions
+Un peu de mal à comprendre les bornes de cohérence.
+Ça veut dire quoi composable ?
+Définitions
+Système réparti : Collection d'entités de calcul autonomes connectées en vue d'accomplir une tâche commune.
+Entités de calcul : (ou processus). Entité d'un réseau capable de décision en fonction de stimuli.  
+Cohérence forte : Les objets ciblés cachent la concurrence et se comportent comme si tous les accès était séquentiels.
+Introduction
+Un système réparti est caractérisé par :
+
+
+L'échelle du système
+
+
+Les moyens d'interactions
+
+
+Gestion des fautes (c.f. : reynal18 attacks) (et nombre de fautes acceptables)
+
+
+Rapport au temps (y a-t-il une horloge partagée ?)
+
+
+Les histoires concurrentes
+Une histoire concurrente est un ensemble d'événements partiellement ordonnés par un ordre de processus et étiquetés par des opérations.
+3 primitives possibles :
+
+
+Broadcast (diffusion fiable) :
+
+
+Validité : tout message reçu est émis par un processus
+
+
+Uniformité : tout message reçu par un processus est reçu par tous les autres processus
+
+
+{FIFO} Broadcast (idem Broadcast) :
+
+
+Réception {FIFO} : tout message reçu par un processus est reçu dans l'ordre d'émission
+
+
+Causal Broadcast (idem {FIFO} Broadcast) :
+
+
+Réception causale : Tout message \$m'\$ envoyé par un processus après réception d'un message \$m\$ est aussi reçu après \$m\$ chez tous les autres processus
+
+
+
+
+Composabilité
+La compossibilité définit la possibilité pour deux types de données abstraits différents, cohérente pris de manière unitaire, de pouvoir être combinés tout en gardant leurs cohérences.
+Décomposable
+La décomposabilité définit la possibilité pour deux types de données abstraits différents cohérents si considérés "ensemble" de rester cohérent si considérés séparément.
+Localité
+La localité est le respect simultané de la composabilité et de la décomposabilité.
+Modèles
+Cohérence forte impossible dans des environnements crédibles de cloud. (Trop de risques de déni de services)
+Ci-dessous une liste des différents paradigmes de modélisation de système répartis :
+Cohérence Séquentiel (Décomposable, Fort)
+Cohérence Séquentiel ({SC}) : Les objets ciblés cachent la concurrence et se comportent comme si tous les accès était séquentiels.  
+Le but est de mimer le comportement "comme si" un serveur centralisait et ordonnait l'information. (Ça peut être le cas ou non, il faut juste que la propriété soit respectée).  
+Il y a un débat sur une notion de la cohérence séquentielle. La première formalisation de ce type de cohérence formulé par Lamport oublie de mentionner la notion de "synchronisation". Ce qui peut conduire a des comportements non cohérents. Elle permet par exemple l'existence d'histoires infinies qui viennent s'ajouter les unes derrières les autres. Ce qui serait absurde dans un système réel. (Exemple : infinité de lectures suivie d'une infinité d'écritures).  
+Il y a donc débat sur la notion de cohérence séquentielle avec une école qui considère ce cas comme plausible et une autre qui souhaite rajouter une notion de synchronisation.
+Linéarisabilité ()
+Il y a ici un lien fort entre l'ordre d'action du processus et son intégration au système. Il y a une synchronicité plus forte.  
+Ici lorsqu'un processus souhaite accéder à un objet, s'il ne rentre pas en conflit avec aucune action d'écriture, il récupère la valeur antérieure à son exécution. (propriété : Registre Sûr).  
+Si plusieurs processus veulent accéder à un objet, et entrent en concurrence avec une écriture, alors ils ne peuvent retourner seulement la valeur avant ou après l'écriture (propriété : Registre Régulier).  
+Si deux lectures ne sont pas concurrentes, alors elles doivent retourner une valeur au moins aussi récente que la lecture antérieure. (propriété : Registre Atomique).
+Sérialisabilité (Décomposable, Faible)
+{ACID} : Atomicité (une transaction est soit complètement acceptée soit complètement avortée), Cohérence (Une transaction exécutée dans un état correct emmène vers un état correct), Isolation (Les transactions n'interfèrent pas entre elles), Durabilité (une transaction acceptée n'est pas remise en cause).
+La sérialisabilité est similaire à la linéarisabilité, à la différence que des transactions peuvent être avortés. Cela à pour effet de rendre le système moins "fort" en termes de consistance.
+Convergence (Composable, Faible)
+La convergence est une notion de cohérence faible. Elle définit un système qui peut à un instant \$t\$ être divergent, mais qui finira sur un temps infini à converger vers un état commun.
+Convergence forte (Composable, Faible)
+La convergence forte est une extension de la convergence où notre histoire est divisée en plusieurs états. Chaque transaction se trouve dans un état avec d'autres transactions avec qui elle partage un "passé commun". On définit le passé commun comme la base de connaissance antérieur à l'exécution de la transaction.
+Data type pour la convergence
+Les types de données vues pour les autres modèles sont peu adapté pour modéliser les interactions dans le cas de la convergence. On privilégie plutôt des types de données qui permettent de définir des états (ex : {OR}-{SET}).
+Intention
+L'intention est une notion qui tend à appliquer la cohérence en fonction de l'intention des utilisateurs. Elle trouve son sens particulièrement dans l'édition collaborative lors d'écritures concurrentes. Mais sa spécification reste floue et c'est un concept qui semble difficile à appliquer.
+Cohérence pipeline (Décomposable, Faible)
+La cohérence pipeline consiste une cohérence ne garantissant pas l'ordre des états finaux. C'est donc une cohérence faible. La chose la plus notable est que le résultat n'est pas garantit pour deux histoires concurrentes équivalentes.
+Cohérence de Cache (Composable, Décomposable, Fort)
+On imagine que chaque type de donnée abstraite utilise une seule et même mémoire qu'il partage avec tous les processus de l'histoire concurrente. Chaque mémoire respecte une cohérence séquentielle.
+Cohérence d'écriture (Faible)
+Un aspect manquant de la convergence est l'absence de cohérence d'écriture. C'est-à-dire que rien ne garantit que les données écrites par un processus soient bien celles lue à la fin par les lectures infinies.  
+Le concept de cohérence d'écriture vise donc à spécifier cette propriété.
+Cohérence d'écriture forte (Faible)
+La cohérence d'écriture forte est une extension de la cohérence d'écriture qui rajoute un ordre dans les opérations d'écriture. Ceci permet d'assurer que chaque opération soit faites dans le même état et assure donc une convergence plus "rapide".
+Cohérence causale
+Cohérence Causale Faible
+Cohérence directe avec son passé local et respect de cette cohérence avec les autres processus par transitivité. Aucune préservation de l'ordre des opérations.
+Résultat potentiellement divergent ?
+Convergence Causale
+Rajout de la notion d'ordre totale. Qui permet de garantir la convergence du résultat.
+Cohérence Causale
+Cohérence avec les écritures du passé causal et des lectures du passé local.
+},
+	file = {Perrin - 2017 - Concurrence et cohérence dans les systèmes réparti.pdf:/home/amaury/Téléchargements/Perrin - 2017 - Concurrence et cohérence dans les systèmes réparti.pdf:application/pdf},
+}
+
+@article{somasekaram_high-availability_2022,
+	title = {High-Availability Clusters: A Taxonomy, Survey, and Future Directions},
+	volume = {187},
+	issn = {01641212},
+	url = {http://arxiv.org/abs/2109.15139},
+	doi = {10.1016/j.jss.2021.111208},
+	shorttitle = {High-Availability Clusters},
+	abstract = {The delivery of key services in domains ranging from finance and manufacturing to healthcare and transportation is underpinned by a rapidly growing number of mission-critical enterprise applications. Ensuring the continuity of these complex applications requires the use of software-managed infrastructures called high-availability clusters ({HACs}). {HACs} employ sophisticated techniques to monitor the health of key enterprise application layers and of the resources they use, and to seamlessly restart or relocate application components after failures. In this paper, we first describe the manifold uses of {HACs} to protect essential layers of a critical application and present the architecture of high availability clusters. We then propose a taxonomy that covers all key aspects of {HACs} -- deployment patterns, application areas, types of cluster, topology, cluster management, failure detection and recovery, consistency and integrity, and data synchronisation; and we use this taxonomy to provide a comprehensive survey of the end-to-end software solutions available for the {HAC} deployment of enterprise applications. Finally, we discuss the limitations and challenges of existing {HAC} solutions, and we identify opportunities for future research in the area.},
+	pages = {111208},
+	journaltitle = {Journal of Systems and Software},
+	shortjournal = {Journal of Systems and Software},
+	author = {Somasekaram, Premathas and Calinescu, Radu and Buyya, Rajkumar},
+	urldate = {2023-06-06},
+	date = {2022-05},
+	eprinttype = {arxiv},
+	eprint = {2109.15139 [cs, eess]},
+	keywords = {Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Networking and Internet Architecture, Electrical Engineering and Systems Science - Systems and Control},
+	annotation = {Interet du papier
+Pas sur que ce soit dans le sujet. Ca semble prendre le sujet plus largement sans parler de la cohérence.
+},
+	file = {arXiv.org Snapshot:/home/amaury/Zotero/storage/B4KCP9BG/2109.html:text/html;Somasekaram et al. - 2022 - High-Availability Clusters A Taxonomy, Survey, an.pdf:/home/amaury/Zotero/storage/K3LQZLC8/Somasekaram et al. - 2022 - High-Availability Clusters A Taxonomy, Survey, an.pdf:application/pdf},
+}
+
+@thesis{kumar_fault-tolerant_2019,
+	title = {Fault-Tolerant Distributed Services in Message-Passing Systems},
+	institution = {Texas A\&M University},
+	type = {phdthesis},
+	author = {Kumar, Saptaparni},
+	date = {2019},
+	annotation = {Fiche Lecture
+Connexes
+Comprendre la théorie derrière le Failure Detector. \_\_T. D. Chandra and S. Toueg, “Unreliable failure detectors for reliable distributed systems,” J. {ACM}, vol. 43, no. 2, pp. 225–267, 1996.\_\_
+Definition
+Fault-Tolerence: The service remains uninterrupted even if some component in the network fail.
+Distributed System: A collection of computers (or nodes) that communicate amongst themselves [...] to perform a given task.
+Distributed Computing: The use of a Distributed System to solve a computational problems.
+Static system: The system composition is fixed.
+Dynamic system: nodes may enter, leave or move in the system with time.
+{FLP} impossibility result: It is impossible to design a distributed system that is both asynchronous and fault-tolerant.
+{ADD} (Average Delayed/Dropped): model used to describe realisticly the network.
+Data-Strcutures:
+
+
+linearizability: a data structure is said to be linearizable if it guarantees that all operations appear to happen at a single pointin time between the invocation and response of the operation.
+
+
+Shared Register: [a data strcuture] that stores a value and has two opérations: read [...] and write.
+
+
+Fault-Tolerent Register: Linearizable (atomic) Shared register.
+
+
+Attacks:
+
+
+crash: a node halts, but was working correctly until it halts.
+
+
+omission: a node fails to receive incoming messages or send outgoing messages.
+
+
+timing: a node's message delivery lies outside of the specified delivery time interval.
+
+
+Byzantine: Malicious attacks, operator mistake, software errors and conventional crash faults.
+
+
+churn: change in system composition due to nodes entering and leaving.
+
+
+Usefull terms:
+
+
+shared memory/message-passing model
+
+
+synchronous/asynchronous systems
+
+
+static/dynamic systems
+
+
+Algorithms of sharded registers:
+
+
+{RAMBO}
+
+
+{DynaStore}
+
+
+Baldoni et Al.
+
+
+Chapter 1
+He's began to define the terms of distributed systemsn and the possibles uses cases.
+He define synchronous message-passing systems as giving the best guarantees. Opposite to asynchronous message-passing systems.  
+Failure Detectors
+He's defining te concept of Failure Detectors as an oracle able to identify the failed nodes. And how they can be used to circumvent the {FLP} impossibility result.
+Actually the Failure Detectors needs a certain level of synchronicity to work. And two lines of research are proposed to solve this problem: The first one is to implement the Failure Detector on a increasingly weaker system model. And the second one is to find the weakest Failure Detector.
+Fault-Tolerant Register
+He defined a "shared register" and explained how it's complicated to implementing them due to the possibility of faulty nodes. And he present the solution who's the Fault-Tolerant Register. He also present the "linearizability" property and how it's used to define the Fault-Tolerant Register.
+Finally he introduce two implementation of the Fault-Tolerant Register: one who's crash-tolerent and the other one who's Byzantine-tolerent.
+Chapter 2
+He precised the context of the implementation. We are on an arbitrary, partitionnable network composed of Average Delayed/Dropped channels ({ADD}).
+The failure detectors can be defined by their accuracy and completness tel que:
+
+
+Strong completeness is satisfied if the failure detector of each node eventually suspects all nodes that are crashed.
+
+
+Eventual strong accuracy is satisfied if the failure detector of every node eventually stops suspecting all nodes that are correct.
+
+
+He described he's algorithm.
+Chapter 3.1
+He purposed a new Fault-Tolerant Register who's crash-tolerent and churn proof.
+The algorithm is tolerent of node who could crash or leave the system.
+There is no hierarchy between the nodes. And the algorithm emulated a shared memory using the message-passing model. 
+Chapter 3.2
+He purposed a new Fault-Tolerant Register who's crash-tolerent and churn and Byzantin proof.
+The model add a notion of server in the previous model (where we had only clients). And a system of asymetric signature.
+Also he proved than it's impossible with thiss model to determine the number of Byzantin server as a fraction of the total number of servers.
+},
+	file = {Kumar - 2019 - Fault-Tolerant Distributed Services in Message-Pas.pdf:/home/amaury/Zotero/storage/Q9XK77W9/Kumar - 2019 - Fault-Tolerant Distributed Services in Message-Pas.pdf:application/pdf;Snapshot:/home/amaury/Zotero/storage/7JB26RAJ/1.html:text/html},
+}
+
+@incollection{goos_causal_1995,
+	location = {Berlin, Heidelberg},
+	title = {From causal consistency to sequential consistency in shared memory systems},
+	volume = {1026},
+	isbn = {978-3-540-60692-5 978-3-540-49263-4},
+	url = {http://link.springer.com/10.1007/3-540-60692-0_48},
+	pages = {180--194},
+	booktitle = {Foundations of Software Technology and Theoretical Computer Science},
+	publisher = {Springer Berlin Heidelberg},
+	author = {Raynal, Michel and Schiper, André},
+	editor = {Thiagarajan, P. S.},
+	editorb = {Goos, Gerhard and Hartmanis, Juris and Leeuwen, Jan},
+	editorbtype = {redactor},
+	urldate = {2023-06-06},
+	date = {1995},
+	langid = {english},
+	doi = {10.1007/3-540-60692-0_48},
+	note = {Series Title: Lecture Notes in Computer Science},
+	file = {Raynal et Schiper - 1995 - From causal consistency to sequential consistency .pdf:/home/amaury/Zotero/storage/B8UNWUSA/Raynal et Schiper - 1995 - From causal consistency to sequential consistency .pdf:application/pdf},
+}
+
+@article{mosberger_memory_1993,
+	title = {Memory consistency models},
+	volume = {27},
+	issn = {0163-5980},
+	url = {https://dl.acm.org/doi/10.1145/160551.160553},
+	doi = {10.1145/160551.160553},
+	abstract = {This paper discusses memory consistency models and their influence on software in the context of parallel machines. In the first part we review previous work on memory consistency models. The second part discusses the issues that arise due to weakening memory consistency. We are especially interested in the influence that weakened consistency models have on language, compiler, and runtime system design. We conclude that tighter interaction between those parts and the memory system might improve performance considerably.},
+	pages = {18--26},
+	number = {1},
+	journaltitle = {{ACM} {SIGOPS} Operating Systems Review},
+	shortjournal = {{SIGOPS} Oper. Syst. Rev.},
+	author = {Mosberger, David},
+	urldate = {2023-06-06},
+	date = {1993-01},
+	langid = {english},
+	file = {Mosberger - 1993 - Memory consistency models.pdf:/home/amaury/Zotero/storage/VF2ZNK6A/Mosberger - 1993 - Memory consistency models.pdf:application/pdf},
+}
+
+@article{lamport_how_1979,
+	title = {How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs},
+	volume = {C-28},
+	issn = {1557-9956},
+	doi = {10.1109/TC.1979.1675439},
+	abstract = {Many large sequential computers execute operations in a different order than is specified by the program. A correct execution is achieved if the results produced are the same as would be produced by executing the program steps in order. For a multiprocessor computer, such a correct execution by each processor does not guarantee the correct execution of the entire program. Additional conditions are given which do guarantee that a computer correctly executes multiprocess programs.},
+	pages = {690--691},
+	number = {9},
+	journaltitle = {{IEEE} Transactions on Computers},
+	author = {{Lamport}},
+	date = {1979-09},
+	note = {Conference Name: {IEEE} Transactions on Computers},
+	keywords = {Computer design, concurrent computing, hardware correctness, multiprocessing, parallel processing},
+	annotation = {Annotations
+« A correct execution is achieved if the results produced are the same as would be produced by executing the program steps in order » (Lamport, 1979, p. 1) Première définition de "coherence séquentiel"
+},
+	file = {IEEE Xplore Abstract Record:/home/amaury/Zotero/storage/IVGSSPNE/1675439.html:text/html;Lamport - 1979 - How to Make a Multiprocessor Computer That Correct.pdf:/home/amaury/Zotero/storage/GY8CWGUV/Lamport - 1979 - How to Make a Multiprocessor Computer That Correct.pdf:application/pdf},
+}

recherches/vanDerLindeLeitaoPreguica.md

@@ -2,6 +2,41 @@
 
 ## Authors: van der Linde, Leitao, Preguica
 
+## Résumé:
+
+Le papier spécifie une amélioration de la cohérence causale, rajoutant des propriétés en renforçant la sécurité. Ils comparent ensuite différentes implémentations de leurs solutions en axant sur le besoin d'une faible latence pour privilégier l'interactivité.
+
+## Plan:
+
+1. Présente les attaques possibles sur la cohérence causale. $3
+2. Définissent les propriétés d'une cohérence causale sécurisée répondant aux attaques. $4
+3. Définit de nouvelles classes de cohérence étendant la cohérence causale. $5
+4. Définit des algorithmes pour implémenter ces classes de cohérence. $5
+5. Présente des résultats de performance de ces algorithmes. $6
+
+## Détails du document
+
+### Types d'attaques
+
+- Tempering: un nœud soumet une opération pour anticiper une opération en attente qui n'a pas encore été exécutée par le système.
+- Omitting dependencies: un nœud n'utilise qu'un sous-ensemble des opérations dans la dépendance. Il sera en mesure de soumettre une tâche concurrente au système.
+- Unseen dependencies (également appelé add): un nœud soumet une opération qui dépend d'une opération qu'il n'a pas vue. Il permet à l'attaquant d'anticiper une opération. (C'est différent du tempering car dans ce cas l'opération n'existe pas encore).
+- Combining omitting and unseen: un nœud peut omettre une dépendance et soumettre une opération qui dépend d'une opération qu'il n'a pas vue.
+- Sibbling generation: créer deux opérations différentes avec le même id. L'attaquant pourrait créer une divergence permanente entre les nœuds.
+
+### Propriétés d'une cohérence causale sécurisée
+
+- **Immutable History**: Chaque opération est envoyée avec son passé causal à chaque nœud valide. (Contrecarre le tempering)
+- **No Future Dependencies**: Chaque opération est envoyée avec son état de connaissance de l'état des nœuds du système. (Contrecarre l'unseen dependencies puisque l'opération sera considérée par l'ensemble du système comme "en retard" et sera donc ignorée)
+- **Causal Execution**: Toute opération $o_i$ appartenant au passé causal d'une opération $o$ doit être sérialisable t.q. : $o_i < o$. (Force une sorte de synchronisation entre les nœuds)
+- **Eventual Sibling Detection**: Chaque opération doit être considérée comme une faute éventuelle et doit donc avoir la possibilité d'être révoqué. La révocation ne peut se produire qu'après l'exécution de l'opération. (Assure que si deux opérations sont créées avec un même identifiant et crée une divergence, alors les nœuds auront toujours un moyen de retourner à un état convergent. Contrecarre **en partie** le sibling generation)
+- **Limitted Omission**: 
+
+<!-- OLD
+# Practical Client-side Replication: Weak Consistency Semantics for Insecure Settings
+
+## Authors: van der Linde, Leitao, Preguica
+
 ## Definition
 
 causal consistency: model enforcing clients to observe a state that respects the causal order of operations. (this is the case for decentralized and peer to peer systems)
@@ -36,4 +71,4 @@ The algorithms they propose used the following solutions for each property:
 
 The Secure Strict Causas Consistency is a variant of the Secure Causal Consistency who is using a trusted service. Such as the enclave in Intel SGX. Thus the usage of a hash of the dependencies is unnecessary.
 An issue of this solution is the cost of the connection to the trusted service. A possible attack would be to connect and disconnect a lot of time of the trusted service to make the system slow.
-This sollution was not explored in the paper due to this issue.
+This sollution was not explored in the paper due to this issue. -->