Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
A timed failures model for extended communicating processes
14th International Colloquium on Automata, languages and programming
Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A software architecture for distributed control systems and its transition system semantics
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Semantical aspects of an architecture for distributed embedded systems
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Concurrency verification: introduction to compositional and noncompositional methods
Concurrency verification: introduction to compositional and noncompositional methods
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
Comparing coordination models and architectures using embeddings
Science of Computer Programming - Special issue on coordination languages and architectures
The Real-Time Behaviour of Asynchronously Communicating Processes
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Correctness of Real Time Systems by Construction
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
A fully abstract model for the exchange of information in multi-agent systems
Theoretical Computer Science
System integration by developing adapters using a database abstraction
Information and Software Technology
| Hi-index | 0.00 |
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.