State- and Event-Based Reactive Programming in Shared Dataspaces

Authors:
Nadia Busi;Antony I. T. Rowstron;Gianluigi Zavattaro
Affiliations:
-;-;-
Venue:
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Year:
2002

Citing 7
Cited 4

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
Solving the Linda multiple rd problem using the copy-collect primitive

Science of Computer Programming
Communication and Concurrency

Communication and Concurrency
WCL: A co-ordination language for geographically distributed agents

World Wide Web
On the Expressiveness of Event Notification in Data-Driven Coordination Languages

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Embedding as a Tool for Language Comparison: On the CSP Hierarchy

CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
T spaces

IBM Systems Journal

Modular event-based systems

The Knowledge Engineering Review
Quantitative information in the tuple space coordination model

Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Coordination as a Service

Fundamenta Informaticae
Coordination as a Service

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traditional Linda programming style, based on the introduction and consumption of data from a common repository, seems not adequate for highly dynamic applications in which it is important to observe modification of the environment which occur quickly. On the other hand, reactive programming seems more appropriate for this kind of applications. In this paper we consider some approaches recently presented in the literature for embedding reactive programming in shared dataspaces, we present a possible classification for these approaches, and we perform a rigorous investigation of their relative advantages and disadvantages.