Concurrency control in groupware systems
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Evolving algebras 1993: Lipari guide
Specification and validation methods
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
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
Design, implementation, and evaluation of a Revision Control System
ICSE '82 Proceedings of the 6th international conference on Software engineering
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
CoreASM: An Extensible ASM Execution Engine
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
XML Database Transformations with Tree Updates
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
A customised ASM thesis for database transformations
Acta Cybernetica
Partial Updates in Complex-Value Databases
Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII
Synchronous parallel database transformations
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
CoreASM: An Extensible ASM Execution Engine
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Hi-index | 0.00 |
A datastructure instance, e.g. a set or file or record, may be modified independently by different parts of a computer system. The modifications may be nested. Such hierarchies of modifications need to be efficiently checked for consistency and integrated. This is the problem of partial updates in a nutshell. In our first paper on the subject, we developed an algebraic framework which allowed us to solve the partial update problem for some useful datastructures including counters, sets and maps. These solutions are used for the efficient implementation of concurrent data modifications in the specification language AsmL. The two main contributions of this paper are (i) a more general algebraic framework for partial updates and (ii) a solution of the partial update problem for sequences and labeled ordered trees.