Transparent object replication: a formal model

Dechering, P.; Jong, Edwin de

doi:10.1109/wordsf.1999.842332

Cited by 3 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An answer to the last question would facilitate early architectural design decisions. Some of these questions have been answered for Splice already [11,18,20].…”

Section: Transparent Replication Of Some Splice Applicationsmentioning

confidence: 99%

Verification of Distributed Dataspace Architectures

Orzan

Pol

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.The space calculus is introduced as a language to model distributed dataspace systems, i.e. distributed applications that use a shared (but possibly distributed) dataspace to coordinate. The publish-subscribe and the global dataspace are particular instances of our model. We give the syntax and operational semantics of this language and provide tool support for functional and performance analysis of its expressions. Functional behaviour can be checked by an automatic translation to μCRL and the use of a model checker. Performance analysis can be done using an automatically generated distributed C prototype.

show abstract

“…An answer to the last question would facilitate early architectural design decisions. Some of these questions have been answered for Splice already [11,18,20].…”

Section: Transparent Replication Of Some Splice Applicationsmentioning

confidence: 99%

Verification of Distributed Dataspace Architectures

Orzan

Pol

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…the possibility to duplicate components without affecting other components in the system. This has also been studied in [8], aiming at a Splice-like architecture in which each component can be replicated. Our aim is to investigate how certain components can be replicated transparently on top of Splice.…”

Section: Vdpol@cwinl 'mentioning

confidence: 99%

Formal verification of replication on a distributed data space architecture

Hooman¹,

Pol

2002

Proceedings of the 2002 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

We investigate the formal verification of safety-critical systems on top of the distributed data space architecture Splice. In Splice each component has its own local data space which can be kept small using keys, time stamps and selective overwriting. We use two complementary formal tools: first the µCRL tool set for a rapid investigation of alternatives by a limited verification with state space exploration techniques; next the most promising solutions are verified in general by means of the interactive theorem prover of PVS. These formal techniques are used to investigate transparent replication of certain components on top of Splice. We prove that a convenient solution can be obtained by means of a slight extension of the write primitive of Splice.

show abstract

Distribution of a simple shared dataspace architecture

Orzan

Pol

2003

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Transparent object replication: a formal model

Cited by 3 publications

References 7 publications

Verification of Distributed Dataspace Architectures

Verification of Distributed Dataspace Architectures

Formal verification of replication on a distributed data space architecture

Distribution of a simple shared dataspace architecture

Contact Info

Product

Resources

About