Experiments in Model-Checking Optimistic Replication Algorithms
Hanifa Boucheneb (VeriForm), Abdessamad Imine (INRIA Lorraine - LORIA, / LIFC)

TL;DR
This paper uses model-checking with UPPAAL to verify the convergence of optimistic replication algorithms based on Operational Transformation, revealing limitations when more than two sites are involved.
Contribution
It introduces a symbolic model for UPPAAL to effectively verify convergence properties of OT algorithms in collaborative editing systems.
Findings
Symbolic model reduces state explosion in UPPAAL verification.
Convergence fails for more than two sites in tested OT algorithms.
Counterexamples provided for non-converging cases.
Abstract
This paper describes a series of model-checking experiments to verify optimistic replication algorithms based on Operational Transformation (OT) approach used for supporting collaborative edition. We formally define, using tool UPPAAL, the behavior and the main consistency requirement (i.e. convergence property) of the collaborative editing systems, as well as the abstract behavior of the environment where these systems are supposed to operate. Due to data replication and the unpredictable nature of user interactions, such systems have infinitely many states. So, we show how to exploit some features of the UPPAAL specification language to attenuate the severe state explosion problem. Two models are proposed. The first one, called concrete model, is very close to the system implementation but runs up against a severe explosion of states. The second model, called symbolic model, aims to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel-Driven Software Engineering Techniques · Formal Methods in Verification · Logic, programming, and type systems
