Symbolic model-checking of optimistic replication algorithms

Authors:
Hanifa Boucheneb;Abdessamad Imine;Manal Najem
Affiliations:
Laboratoire VeriForm, Department of Computer Engineering, École Polytechnique de Montréal, Montréal, Québec, Canada;INRIA Grand-Est & Nancy-Université, France;Laboratoire VeriForm, Department of Computer Engineering, École Polytechnique de Montréal, Montréal, Québec, Canada
Venue:
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Year:
2010

Citing 13
Cited 0

Concurrency control in groupware systems

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
An integrating, transformation-oriented approach to concurrency control and undo in group editors

CSCW '96 Proceedings of the 1996 ACM conference on Computer supported cooperative work
Serialization of concurrent operations in a distributed collaborative environment

GROUP '97 Proceedings of the international ACM SIGGROUP conference on Supporting group work: the integration challenge
Achieving convergence, causality preservation, and intention preservation in real-time cooperative editing systems

ACM Transactions on Computer-Human Interaction (TOCHI)
Operational transformation in real-time group editors: issues, algorithms, and achievements

CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
Copies convergence in a distributed real-time collaborative environment

CSCW '00 Proceedings of the 2000 ACM conference on Computer supported cooperative work
Concurrent Operations in a Distributed and Mobile Collaborative Environment

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Formal design and verification of operational transformation algorithms for copies convergence

Theoretical Computer Science - Algebraic methodology and software technology
Lower and upper bounds in zone-based abstractions of timed automata

International Journal on Software Tools for Technology Transfer (STTT)
Transparent adaptation of single-user applications for multi-user real-time collaboration

ACM Transactions on Computer-Human Interaction (TOCHI)
Proving correctness of transformation functions in real-time groupware

ECSCW'03 Proceedings of the eighth conference on European Conference on Computer Supported Cooperative Work
On Model-Checking Optimistic Replication Algorithms

FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Operational Transformation (OT) approach, used in many collaborative editors, allows a group of users to concurrently update replicas of a shared object and exchange their updates in any order. The basic idea of this approach is to transform any received update operation before its execution on a replica of the object. This transformation aims to ensure the convergence of the different replicas of the object. However, designing transformation algorithms for achieving convergence is a critical and challenging issue. In this paper, we address the verification of OT algorithms with a symbolic model-checking technique. We show how to use the difference bound matrices to explore symbolically infinite state-spaces of such systems and provide symbolic counterexamples for the convergence property.