Formal design and verification of operational transformation algorithms for copies convergence

DOI10.1016/j.tcs.2005.09.066zbMath1086.68019OpenAlexW2015669758MaRDI QIDQ820129

Michaël Rusinowitch, Gérald Oster, Pascal Molli, Abdessamad Imine

Publication date: 6 April 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.066

zbMATH Keywords

replicationalgebraic specificationautomated verificationoperational transformationdistributed groupware systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Distributed systems (68M14)

Related Items (5)

Formal design and verification of operational transformation algorithms for copies convergence ⋮ Specification and space complexity of collaborative text editing ⋮ Unnamed Item ⋮ Normalization of edit sequences for text synchronization ⋮ Verified Operational Transformation for Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal design and verification of operational transformation algorithms for copies convergence
• Proof of correctness of Ressel's adopted algorithm
• Incorporating decision procedures in implicit induction.
• A hidden agenda
• Observational proofs by rewriting.
• On the move to meaningful internet systems 2002: CoopIS, DOA, and ODBASE. Confederated international conferences CoopIS, DOA, and ODBASE 2002. Proceedings
• Behavioural and abstractor specifications
• Automated Mathematical Induction

This page was built for publication: Formal design and verification of operational transformation algorithms for copies convergence