JUCS - Journal of Universal Computer Science 7(11): 917-951, doi: 10.3217/jucs-007-11-0917
Partial Updates: Exploration
expand article infoYuri Gurevich‡, Nikolai Tillmann§
‡ Microsoft Research One Microsoft Way, Redmond, WA, United States of America§ One Microsoft Way, Redmond, WA, United States of America

Corresponding author: Yuri Gurevich ( gurevich@microsoft.com )

© Yuri Gurevich, Nikolai Tillmann.
This article is freely available under the J.UCS Open Content License.
Citation: Gurevich Y, Tillmann N (2001) Partial Updates: Exploration. JUCS - Journal of Universal Computer Science 7(11): 917-951. https://doi.org/10.3217/jucs-007-11-0917
Open Access
Abstract
The partial update problem for parallel abstract state machines has manifested itself in the cases of counters, sets and maps. We propose a solution of the problem that lends itself to an efficient implementation and covers the three cases mentioned above. There are other cases of the problem that require a more general framework.
Keywords
Abstract state machine, AsmL, ASM thesis, partial updates, submachines, synchronous parallelism, updates