Abstract : A widespread approach to software service analysis uses session types. Very different type theories for binary and multiparty protocols have been developed; establishing precise connections between them remains an open problem. We present the first formal relation between two existing theories of binary and multiparty session types: a binary system rooted in linear logic, and a multiparty system based on automata theory. Our results enable the analysis of multiparty protocols using a (much simpler) type theory for binary protocols, ensuring protocol fidelity and deadlock-freedom. As an application, we offer the first theory of multiparty session types with behavioral genericity. This theory is natural and powerful; its analysis techniques reuse results for binary session types.
Type de document :
Communication dans un congrès
Elvira Albert; Ivan Lanese. 36th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2016, Heraklion, Greece. Lecture Notes in Computer Science, LNCS-9688, pp.74-95, 2016, Formal Techniques for Distributed Objects, Components, and Systems. 〈10.1007/978-3-319-39570-8_6〉
https://hal.inria.fr/hal-01432929
Contributeur : Hal Ifip
<>
Soumis le : jeudi 12 janvier 2017 - 11:34:58
Dernière modification le : lundi 9 octobre 2017 - 13:18:03
Document(s) archivé(s) le : vendredi 14 avril 2017 - 13:06:13
Luís Caires, Jorge Pérez. Multiparty Session Types Within a Canonical Binary Theory, and Beyond. Elvira Albert; Ivan Lanese. 36th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2016, Heraklion, Greece. Lecture Notes in Computer Science, LNCS-9688, pp.74-95, 2016, Formal Techniques for Distributed Objects, Components, and Systems. 〈10.1007/978-3-319-39570-8_6〉. 〈hal-01432929〉
