A Decentralized Analysis of Multiparty Protocols

by   Bas van den Heuvel, et al.

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 address this relevant problem by proposing a decentralized analysis of multiparty session protocols for asynchronous processes with recursion. Our solution rests upon APCP, a new type system that ensures protocol conformance and deadlock freedom with respect to binary protocols. Our analysis enables the sound and complete transfer of correctness from APCP to multiparty session protocols.


page 1

page 2

page 3

page 4


Multiparty Session Programming with Global Protocol Combinators

Multiparty Session Types (MPST) is a typing discipline for communication...

CAMP: Cost-Aware Multiparty Session Protocols

This paper presents CAMP, a new static performance analysis framework fo...

Statically Verified Refinements for Multiparty Protocols

With distributed computing becoming ubiquitous in the modern era, safe d...

Domain-Aware Session Types (Extended Version)

We develop a generalization of existing Curry-Howard interpretations of ...

Automated Modular Verification for Race-Free Channels with Implicit and Explicit Synchronization

Ensuring the correctness of software for communication centric programs ...

Protocol Proxy: An FTE-based Covert Channel

In a hostile network environment, users must communicate without being d...

Message Type Identification of Binary Network Protocols using Continuous Segment Similarity

Protocol reverse engineering based on traffic traces infers the behavior...