How to write parallel programs: a first course
How to write parallel programs: a first course
Comparing coordination models based on shared distributed replicated data
Proceedings of the 1999 ACM symposium on Applied computing
Formal verification of replication on a distributed data space architecture
Proceedings of the 2002 ACM symposium on Applied computing
JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
Introduction to Process Algebra
Introduction to Process Algebra
Process Calculi for Coordination: From Linda to JavaSpaces
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
On the Verification of Coordination
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
µCRL: A Toolset for Analysing Algebraic Specifications
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Refinement and Verification Applied to an In-Flight Data Acquisition Unit
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Verifying fault-tolerant Erlang programs
Proceedings of the 2005 ACM SIGPLAN workshop on Erlang
Distribution of a Simple Shared Dataspace Architecture
Fundamenta Informaticae
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Distribution of a Simple Shared Dataspace Architecture
Fundamenta Informaticae
| Hi-index | 0.00 |
We study a formal specification of the shared data space architecture, JavaSpaces. This Java technology provides a virtual space for entities, like clients and servers, to communicate by sharing objects. We use 碌CRL, a language that combines abstract data types with process algebra, to model an abstraction of this coordination architecture. Besides the basic primitives write, read and take, our model captures transactions and leasing. The main purpose of the proposed formalism is to allow the verification of distributed applications built under the JavaSpaces model. A simple case study is analyzed and automatically model checked using the 碌CRL and CADP tool sets.