Proving Copyless Message Passing
No abstract available.
Related papers
- Typing Copyless Message Passing ESOP 2011
- Using Message Passing for Distributed Programming: Proof Rules, Disciplines TOPLAS 1984
- Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing POPL 2024
- DafnyMPI: A Dafny Library for Verifying Message-Passing Concurrent Programs POPL 2026
- A Type Discipline for Message Passing Parallel Programs TOPLAS 2022
- Mixtris: Mechanised Higher-Order Separation Logic for Mixed Choice Multiparty Message Passing OOPSLA 2026
- Denotational reasoning for asynchronous multiparty session types ESOP 2026
- Multris: Functional Verification of Multiparty Message Passing in Separation Logic OOPSLA 2024