A decentralized analysis of multiparty protocols

Abstract

Protocols provide the unifying glue in concurrent and distributed software today; verifying that message-passing programs conform to such governing protocols is important but difficult. Static approaches based on multiparty session types (MPST) use protocols as types to avoid protocol violations and deadlocks in programs. An elusive problem for MPST is to ensure both protocol conformance and deadlock-freedom for implementations with interleaved and delegated protocols. We propose a decentralized analysis of multiparty protocols, specified as global types and implemented as interacting processes in an asynchronous π -calculus. Our solution rests upon two novel notions: router processes and relative types . While router processes use the global type to enable the composition of participant implementations in arbitrary process networks, relative types extract from the global type the intended interactions and dependencies between pairs of participants. In our analysis, processes are typed using APCP, a type system that ensures protocol conformance and deadlock-freedom with respect to binary protocols, developed in prior work. Our decentralized, router-based analysis enables the sound and complete transference of protocol conformance and deadlock-freedom from APCP to multiparty protocols. • A new analysis of multiparty protocols expressed as Multiparty Session Types (MPST). • The analysis relies on APCP, a typed process calculus for binary sessions with asynchronous communication. • Novel notions: router processes (which connect implementations) and relative types (protocols between pairs of participants). • The analysis ensures protocol-conformance and deadlock-freedom; it also supports delegation and interleaving. • Process implementations can have arbitrary topologies; decentralized and centralized networks arise as instances.