A Constraint-based Approach for Generating Transformation Patterns

Undoing operations is an indispensable feature for many collaborative applications, mainly collaborative editors. It provides the ability to restore a correct state of shared data after erroneous operations. In particular, selective undo allows to undo any operation and is based on rearranging ope...

Full description

Bibliographic Details
Main Authors: Asma Cherif, Abdessamad Imine
Format: Article
Language:English
Published: Open Publishing Association 2015-12-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1512.07684v1
id doaj-ddb3f0937a11459a8d318f6c3e3874e7
record_format Article
spelling doaj-ddb3f0937a11459a8d318f6c3e3874e72020-11-24T23:22:35ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802015-12-01201Proc. FOCLASA 2015486210.4204/EPTCS.201.4:7A Constraint-based Approach for Generating Transformation PatternsAsma Cherif0Abdessamad Imine1 Umm al-Qura University, Saudi Arabia Lorraine University and Inria Nancy Grand-Est, France Undoing operations is an indispensable feature for many collaborative applications, mainly collaborative editors. It provides the ability to restore a correct state of shared data after erroneous operations. In particular, selective undo allows to undo any operation and is based on rearranging operations in the history thanks to the Operational Transformation (OT) approach. OT is an optimistic replication technique allowing for updating the shared data concurrently while maintaining convergence. It is a challenging task how to meaningfully combine OT and undo approaches. Indeed, undoing operations that are received and executed out-of-order at different sites leads to divergence cases. Even though various undo solutions have been proposed over the recent years, they are either limited or erroneous. In this paper, we propose a constraint-based approach to address the undo problem. We use Constraint Satisfaction Problem (CSP) theory to devise correct and undoable transformation patterns (w.r.t OT and undo properties) which considerably simplifies the design of collaborative objects.http://arxiv.org/pdf/1512.07684v1
collection DOAJ
language English
format Article
sources DOAJ
author Asma Cherif
Abdessamad Imine
spellingShingle Asma Cherif
Abdessamad Imine
A Constraint-based Approach for Generating Transformation Patterns
Electronic Proceedings in Theoretical Computer Science
author_facet Asma Cherif
Abdessamad Imine
author_sort Asma Cherif
title A Constraint-based Approach for Generating Transformation Patterns
title_short A Constraint-based Approach for Generating Transformation Patterns
title_full A Constraint-based Approach for Generating Transformation Patterns
title_fullStr A Constraint-based Approach for Generating Transformation Patterns
title_full_unstemmed A Constraint-based Approach for Generating Transformation Patterns
title_sort constraint-based approach for generating transformation patterns
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2015-12-01
description Undoing operations is an indispensable feature for many collaborative applications, mainly collaborative editors. It provides the ability to restore a correct state of shared data after erroneous operations. In particular, selective undo allows to undo any operation and is based on rearranging operations in the history thanks to the Operational Transformation (OT) approach. OT is an optimistic replication technique allowing for updating the shared data concurrently while maintaining convergence. It is a challenging task how to meaningfully combine OT and undo approaches. Indeed, undoing operations that are received and executed out-of-order at different sites leads to divergence cases. Even though various undo solutions have been proposed over the recent years, they are either limited or erroneous. In this paper, we propose a constraint-based approach to address the undo problem. We use Constraint Satisfaction Problem (CSP) theory to devise correct and undoable transformation patterns (w.r.t OT and undo properties) which considerably simplifies the design of collaborative objects.
url http://arxiv.org/pdf/1512.07684v1
work_keys_str_mv AT asmacherif aconstraintbasedapproachforgeneratingtransformationpatterns
AT abdessamadimine aconstraintbasedapproachforgeneratingtransformationpatterns
AT asmacherif constraintbasedapproachforgeneratingtransformationpatterns
AT abdessamadimine constraintbasedapproachforgeneratingtransformationpatterns
_version_ 1725567406397456384