Skip to Main content Skip to Navigation
Journal articles

A Sound Algorithm for Asynchronous Session Subtyping and its Implementation

Abstract : Session types, types for structuring communication between endpoints in concurrent systems, are recently being integrated into mainstream programming languages. In practice, a very important notion for dealing with such types is that of subtyping, since it allows for typing larger classes of systems, where a program has not precisely the expected behavior but a similar one. Unfortunately, recent work has shown that subtyping for session types in an asynchronous setting is undecidable. To cope with this negative result, the only approaches we are aware of either restrict the syntax of session types or limit communication (by considering forms of bounded asynchrony). Both approaches are too restrictive in practice, hence we proceed differently by presenting an algorithm for checking subtyping which is sound, but not complete (in some cases it terminates without returning a decisive verdict). The algorithm is based on a tree representation of the coinductive definition of asynchronous subtyping; this tree could be infinite, and the algorithm checks for the presence of finite witnesses of infinite successful subtrees. Furthermore, we provide a tool that implements our algorithm. We use this tool to test our algorithm on many examples that cannot be managed with the previous approaches, and to provide an empirical evaluation of the time and space cost of the algorithm.
Document type :
Journal articles
Complete list of metadata
Contributor : Mario Bravetti Connect in order to contact the contributor
Submitted on : Friday, September 10, 2021 - 12:06:06 PM
Last modification on : Friday, August 5, 2022 - 12:35:04 PM


Publisher files allowed on an open archive




Mario Bravetti, Marco Carbone, Julien Lange, Nobuko Yoshida, Gianluigi Zavattaro. A Sound Algorithm for Asynchronous Session Subtyping and its Implementation. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2021, ⟨10.23638/LMCS-17(1:20)2021⟩. ⟨hal-03340689⟩



Record views


Files downloads