Verifying programs that use causally-ordered message-passing

DOI10.1016/0167-6423(95)00002-AMaRDI QIDQ1893537zbMATH OpenFDO

Authors Scott D. Stoller, Fred B. Schneider

Publication date 4 July 1995

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(95)00002-A

zbMATH Keywords

causally-ordered deliveryHoare-style proof system

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Synchronous, asynchronous, and causally ordered communication
• Using the causal domain to specify and verify distributed programs
• Using message passing for distributed programming: proof rules and disciplines
• The causal ordering abstraction and a simple way to implement it

Cited in

(6)

• Verifying the correctness of distributed systems via mergeable parallelism
• Using message passing for distributed programming: proof rules and disciplines
• scientific article; zbMATH DE number 2036578 (Why is no real title available?)
• Synchronous, asynchronous, and causally ordered communication
• Shared contract-obedient endpoints
• Using the causal domain to specify and verify distributed programs

This page was built for publication: Verifying programs that use causally-ordered message-passing

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