Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-39570-8_6 | FORTE |
Field | DocType | Volume |
Fidelity,Automata theory,Open problem,Formal language,Computer science,Type theory,Theoretical computer science,Linear logic,Binary number,Theory of computation,Distributed computing | Conference | 9688 |
ISSN | Citations | PageRank |
0302-9743 | 10 | 0.68 |
References | Authors | |
16 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luís Caires | 1 | 1037 | 63.30 |
| Jorge A. Pérez | 2 | 222 | 21.19 |