Distribution of a simple shared dataspace architecture

Orzan, Simona; Pol, Jaco van de

doi:10.1016/s1571-0661(05)80378-0

Cited by 3 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Earlier work on the operational semantics of Splice-like languages includes a transition system semantics for a basic language of write and read statements (without query) [5]. In [22], an operational semantics is provided by a translation to process algebra. That paper focuses on a global dataspace view for a simple fragment of Splice.…”

Section: Operational Semanticsmentioning

confidence: 99%

Semantic models of a timed distributed dataspace architecture

Hooman

Pol

2005

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

We investigate various formal aspects of a distributed dataspace architecture in which data storage is based on time stamps. An operational and a denotational semantics have been defined and the equivalence of these two formulations has been proved. Moreover, the denotational semantics is fully abstract with respect to the observation of produced data items. It is used as a basis for compositional reasoning about components, supported by the interactive theorem prover PVS. We use this framework for a small example where components make mutual assumptions about each other's output.

show abstract

Section: Operational Semanticsmentioning

confidence: 99%

Semantic models of a timed distributed dataspace architecture

Hooman

Pol

2005

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

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

Self Cite

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

Verifying Properties of Coordination by Well-Structured Transition Systems

Viroli

2004

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Distribution of a simple shared dataspace architecture

Cited by 3 publications

References 21 publications

Semantic models of a timed distributed dataspace architecture

Semantic models of a timed distributed dataspace architecture

Verification of Distributed Dataspace Architectures

Verifying Properties of Coordination by Well-Structured Transition Systems

Contact Info

Product

Resources

About