Concurrency control in groupware systems
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Automatic proofs by induction in theories without constructors
Information and Computation
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of theoretical computer science (vol. B)
Understanding the limitations of causally and totally ordered communication
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
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
Using induction and rewriting to verify and complete parameterized specifications
Theoretical Computer Science
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
A general framework to build contextual cover set
Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
On the consistency problem in mobile distributed computing
Proceedings of the second ACM international workshop on Principles of mobile computing
Incorporating decision procedures in implicit induction
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Concurrent Operations in a Distributed and Mobile Collaborative Environment
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm
Journal of Automated Reasoning
Proof of correctness of Ressel's adOPTed algorithm
Information Processing Letters
Using the transformational approach to build a safe and generic data synchronizer
GROUP '03 Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work
Ensuring Content and Intention Consistency in Real-Time Group Editors
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Operational transformation for collaborative word processing
CSCW '04 Proceedings of the 2004 ACM conference on Computer supported cooperative work
ACM Computing Surveys (CSUR)
Proving correctness of transformation functions in real-time groupware
ECSCW'03 Proceedings of the eighth conference on European Conference on Computer Supported Cooperative Work
Validation of the JavaCard platform with implicit induction techniques
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Decentralized concurrency control for real-time collaborative editors
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Coordination Model for Real-Time Collaborative Editors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
| Hi-index | 0.00 |
The Operational Transformation (OT) approach is a technique for supporting optimistic replication in collaborative and mobile systems. It allows the users to concurrently update the shared data and exchange their updates in any order since the convergence of all replicas, i.e. the fact that all users view the same data, is ensured in all cases. However, designing algorithms for achieving convergence with the OT approach is a critical and challenging issue. In this paper, we address this issue for the important case where the shared data has a linear structure such as lists, texts, ordered XML trees, etc. We analyze the problem and we propose a generic solution with its formal analysis. We also show in this work how to support the formal design of an OT algorithm with a rewrite-based theorem prover. This theorem prover enables us to envisage the large number of cases required for the correctness proof of the algorithm. Since the manual proofs of all previously published algorithms were wrong, this shows the decisive advantage of using an automatic prover in this context.