A logical approach to type soundness

A Timany, R Krebbers, D Dreyer, L Birkedal - Journal of the ACM, 2024 - dl.acm.org
Type soundness, which asserts that “well-typed programs cannot go wrong,” is widely
viewed as the canonical theorem one must prove to establish that a type system is doing its …

Multris: Functional Verification of Multiparty Message Passing in Separation Logic

JK Hinrichsen, J Jacobs, R Krebbers - Proceedings of the ACM on …, 2024 - dl.acm.org
We introduce Multris, a separation logic for verifying functional correctness of programs that
combine multiparty message-passing communication with shared-memory concurrency. The …

Realistic Realizability: Specifying ABIs You Can Count On

A Wagner, Z Eisbach, A Ahmed - Proceedings of the ACM on …, 2024 - dl.acm.org
The Application Binary Interface (ABI) for a language defines the interoperability rules for its
target platforms, including data layout and calling conventions, such that compliance with …

Completeness of Asynchronous Session Tree Subtyping in Coq

B Ekici, N Yoshida - … on Interactive Theorem Proving (ITP 2024), 2024 - drops.dagstuhl.de
Multiparty session types (MPST) serve as a foundational framework for formally specifying
and verifying message passing protocols. Asynchronous subtyping in MPST allows for …

Characterizing Implementability of Global Protocols with Infinite States and Data

E Li, F Stutz, T Wies, D Zufferey - arXiv preprint arXiv:2411.05722, 2024 - arxiv.org
We study the implementability problem for an expressive class of symbolic communication
protocols involving multiple participants. Our symbolic protocols describe infinite states and …

Completeness of asynchronous session tree subtyping in Coq

N Yoshida, B Ekici - 2024 - ora.ox.ac.uk
Multiparty session types (MPST) serve as a foundational framework for formally specifying
and verifying message passing protocols. Asynchronous subtyping in MPST allows for …