Causing communication closure: safe program composition with reliable non-FIFO channels

DOI10.1007/s00446-009-0081-9zbMath1267.68152arXivcs/0701064OpenAlexW1994280657MaRDI QIDQ2377131

Kai Engelhardt, Yoram Moses

Publication date: 28 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0701064

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of distributed programs into communication-closed layers
• A principle for sequential reasoning about distributed algorithms
• Complexity of network synchronization
• Time, clocks, and the ordering of events in a distributed system
• From sequential layers to distributed processes
• Distributed Computing
• Distributed Computing – IWDC 2005

This page was built for publication: Causing communication closure: safe program composition with reliable non-FIFO channels