Using message passing for distributed programming: proof rules and disciplines

DOI10.1145/579.583MaRDI QIDQ3321441zbMATH OpenOpenAlexFDO

Authors Richard D. Schlichting, Fred B. Schneider

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

partial correctness of concurrent programsreliable virtual circuit service, remote procedure callrendezvoussatisfaction proofsunreliable datagram service

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3900139
• scientific article; zbMATH DE number 3878340
• scientific article; zbMATH DE number 3997153
• A compositional proof system for distributed programs
• Verifying programs that use causally-ordered message-passing

Cited in

(12)

• Messages versus messengers in distributed programming
• An overview of message passing environments
• A principle for sequential reasoning about distributed algorithms
• Verifying programs that use causally-ordered message-passing
• Verifying the correctness of distributed systems via mergeable parallelism
• On the interconnection of message passing systems
• Distributed Algorithms for Message-Passing Systems
• scientific article; zbMATH DE number 3900139 (Why is no real title available?)
• scientific article; zbMATH DE number 3997153 (Why is no real title available?)
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3321441)