Using message passing for distributed programming: proof rules and disciplines

DOI10.1145/579.583zbMath0536.68023OpenAlexW2160098227MaRDI QIDQ3321441

Fred B. Schneider, Richard D. Schlichting

Publication date: 1984

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/579.583

zbMATH Keywords

rendezvouspartial correctness of concurrent programsreliable virtual circuit service, remote procedure callsatisfaction proofsunreliable datagram service

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (4)

A principle for sequential reasoning about distributed algorithms ⋮ Implementation of hierarchical F-channels for high-performance distributed computing ⋮ Synchronous, asynchronous, and causally ordered communication ⋮ A complete axiomatic semantics of spawning

This page was built for publication: Using message passing for distributed programming: proof rules and disciplines