TP1-valid Transformation Functions for Operations on ordered n-ary Trees

December 18, 2015 ยท The Ethereal ยท ๐Ÿ› ACM Symposium on Applied Computing

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tim Jungnickel, Tobias Herb arXiv ID 1512.05949 Category cs.LO: Logic in CS Cross-listed cs.HC Citations 10 Venue ACM Symposium on Applied Computing Last Checked 6 months ago
Abstract
Collaborative work on shared documents was revolutionized by web services like Google Docs or Etherpad. Multiple users can work on the same document in a comfortable and distributed way. For the synchronization of the changes a replication system named Operational Transformation is used. Such a system consists of a control algorithm and a transformation function. In essence, a transformation function solves the conflicts that arise when multiple users change the document at the same time. In this work we investigate on the correctness of such transformation functions. We introduce transformation functions n-ary trees that we designed especially for the purpose of synchronization changes on JSON objects. We provide a detailed proof of the necessary property: the Transformation Property 1.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS