Formal verification of replication on a distributed data space architecture
Proceedings of the 2002 ACM symposium on Applied computing
Distribution of a Simple Shared Dataspace Architecture
Fundamenta Informaticae
Distribution of a Simple Shared Dataspace Architecture
Fundamenta Informaticae
Hi-index | 0.00 |
We present a formal object model in which replication of components and recovery from crash failures are transparent. The model is based on concurrently executing objects that interact through a shared data space.We formally define the model by a denotational semantics in which the possible behaviors of an object are defined by a corresponding set of state transition traces. Using the semantics, we derive some fundamental algebraic properties of the model, that reflect transparent replication and crash recovery.