On proving communication closedness of distributed layers
Proc. of the sixth conference on Foundations of software technology and theoretical computer science
Tight bounds for the sequence transmission problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Reliable communication over unreliable channels
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Algorithms
Layers as Knowledge Transitions in the Design of Distributed Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
The Need for Headers: An Impossibility Result for Communication over Unreliable Channels
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Layering Techniques for Development of Parallel Systems
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Single-Bit messages are insufficient in the presence of duplication
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Safe composition of distributed programs communicating over order-preserving imperfect channels
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Safe composition of distributed programs communicating over order-preserving imperfect channels
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Hi-index | 0.00 |
A semantic framework for analyzing safe composition of distributed programs is presented. Its applicability is illustrated by a study of program composition when communication is reliable but not necessarily FIFO . In this model, special care must be taken to ensure that messages do not accidentally overtake one another in the composed program. We show that barriers do not exist in this model. Indeed, no program that sends or receives messages can automatically be composed with arbitrary programs without jeopardizing their intended behavior. Safety of composition becomes context-sensitive and new tools are needed for ensuring it. A notion of sealing is defined, where if a program P is immediately followed by a program Q that seals P then P will be communication-closed—it will execute as if it runs in isolation. The investigation of sealing in this model reveals a novel connection between Lamport causality and safe composition. A characterization of sealable programs is given, as well as efficient algorithms for testing if Q seals P and for constructing a seal for a significant class of programs. It is shown that every sealable program that is open to interference on O(n2) channels can be sealed using O(n) messages.