The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Multiparty Asynchronous Session Types
Open accessAbstract
Communication is a central elements in software development. As a potential typed foundation for structured communication-centered programming, session types have been studied over the past decade for a wide range of process calculi and programming languages, focusing on binary (two-party) sessions. This work extends the foregoing theories of binary session types to multiparty, asynchronous sessions, which often arise in practical communication-centered applications. Presented as a typed calculus for mobile processes, the theory introduces a new notion of types in which interactions involving multiple peers are directly abstracted as a global scenario. Global types retain the friendly type syntax of binary session types while specifying dependencies and capturing complex causal chains of multiparty asynchronous interactions. A global type plays the role of a shared agreement among communication peers and is used as a basis of efficient type-checking through its projection onto individual peers. The fundamental properties of the session type discipline, such as communication safety, progress, and session fidelity, are established for general n-party asynchronous interactions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Applied cryptography: Protocols, algorithms, and source code in C
(1994) · Computer Law & Security Report · doi:10.1016/0267-3649(94)90017-5 · Cited by 3,411
Types and Programming Languages
Pierce, B. C. (2002) · Cited by 2,226
The International Telecommunication Union
Jones, R. W. (2002) · IEEE Antennas and Propagation Society International Symposium 1997. Digest · doi:10.1109/aps.1997.631791 · Cited by 1,909
Language primitives and type discipline for structured communication-based programming
Honda, K., VASCONCELOS, V. T., & Kubo, M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0053567 · Cited by 812
Self-citationMultiparty asynchronous session types
Honda, K., Yoshida, N., & Carbone, M. (2008) · Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1328438.1328472 · Cited by 646
Self-citationAdvanced Message Queuing Protocol
Vinoski, S. (2006) · IEEE Internet Computing · doi:10.1109/mic.2006.116 · Cited by 450
Subtyping for session types in the pi calculus
Gay, S., & Hole, M. (2005) · Acta Informatica · doi:10.1007/s00236-005-0177-z · Cited by 373
An interaction-based language and its typing system
Takeuchi, K., Honda, K., & Kubo, M. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58184-7_118 · Cited by 339
Self-citationSession Types as Intuitionistic Linear Propositions
Caires, L., & Pfenning, F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15375-4_16 · Cited by 319
Language support for fast and reliable message-based communication in singularity OS
Fähndrich, M., Aiken, M., Hawblitzel, C., Hodson, O., Hunt, G., Larus, J. R., & Levi, S. (2006) · Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 · doi:10.1145/1217935.1217953 · Cited by 289
Linear type theory for asynchronous session types
GAY, S. J., & VASCONCELOS, V. T. (2010) · Journal of Functional Programming · doi:10.1017/s0956796809990268 · Cited by 203
Wadler, P. (2012) · Proceedings of the 17th ACM SIGPLAN international conference on Functional programming · doi:10.1145/2364527.2364568 · Cited by 162
Secure distributed programming with value-dependent types
Swamy, N., Chen, J., Fournet, C., Strub, P.-Y., Bhargavan, K., & Yang, J. (2011) · ACM SIGPLAN Notices · doi:10.1145/2034574.2034811 · Cited by 156
Session Types for Object-Oriented Languages
Mariangiola Dezani-ciancaglini, A., Mostrous, D., Yoshida, N., & Drossopoulou, S. (2006) · Lecture notes in computer science · doi:10.1007/11785477_20 · Cited by 141
Self-citationSecure distributed programming with value-dependent types
Swamy, N., Chen, J., Cédric Fournet, A., Strub, P.-Y., Bhargavan, K., & Yang, J. (2011) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2034773.2034811 · Cited by 140
Graph types for monadic mobile processes
Yoshida, N. (1996) · Lecture notes in computer science · doi:10.1007/3-540-62034-6_64 · Cited by 138
Self-citationYoshida, N., & Vasconcelos, V. T. (2007) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2007.02.056 · Cited by 135
Self-citationDeniélou, P.-M., & Yoshida, N. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39212-2_18 · Cited by 127
Self-citationHennessy, M. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511611063 · Cited by 125
Strong normalisation in the π-calculus
Yoshida, N., Berger, M., & Honda, K. (2004) · Information and Computation · doi:10.1016/j.ic.2003.08.004 · Cited by 123
Self-citationCiaffaglione, A., Hennessy, M., & Rathke, J. (2005) · Cited by 104
Type checking a multithreaded functional language with session types
VASCONCELOS, V. T., Gay, S. J., & Ravara, A. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.06.028 · Cited by 95
Cryptographic Protocol Synthesis and Verification for Multiparty Sessions
Bhargavan, K., Corin, R., Deniélou, P.-M., Fournet, C., & Leifer, J. J. (2009) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2009.26 · Cited by 89
An Implementation of Session Types
Neubauer, M., & Thiemann, P. J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24836-1_5 · Cited by 76
Correspondence assertions for process synchronization in concurrent communications
Bonelli, E., Compagnoni, A. B., & Gunter, E. L. (2005) · Journal of Functional Programming · doi:10.1017/s095679680400543x · Cited by 58
Bounded polymorphism in session types
Gay, S. J. (2008) · Mathematical Structures in Computer Science · doi:10.1017/s0960129508006944 · Cited by 50
Session Types for Access and Information Flow Control
Capecchi, S., Castellani, I., Mariangiola Dezani-ciancaglini, A., & Rezk, T. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15375-4_17 · Cited by 42
Ng, N., Coutinho, J. G. F., & Yoshida, N. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46663-6_11 · Cited by 39
Self-citationGarralda, P., Compagnoni, A. B., & Mariangiola Dezani-ciancaglini, A. (2006) · ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/1140335.1140344 · Cited by 35
Pabble: parameterised Scribble
Ng, N., & Yoshida, N. (2014) · Service Oriented Computing and Applications · doi:10.1007/s11761-014-0172-8 · Cited by 29
Self-citationTyping access control and secure information flow in sessions
Capecchi, S., Castellani, I., & Mariangiola Dezani-ciancaglini, A. (2014) · Information and Computation · doi:10.1016/j.ic.2014.07.005 · Cited by 20
A Conversation with Steve Ross-Talbot
O'Hanlon, C. (2006) · Queue · doi:10.1145/1122674.1122684 · Cited by 18
Web Services, Mobile Processes and Types.
Honda, K., Yoshida, N., & Carbone, M. (2007) · Bulletin of the European Association for Theoretical Computer Science · Cited by 14
Self-citation
Metadata
- Authors
- Honda, K., Yoshida, N., & Carbone, M.
- Venue
- Journal of the ACM
- Published
- 2016-03-03
- Volume
- 63
- Issue
- 1
- Pages
- 1-67
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2325347394
- Cited by
- 283
- References
- 35
- FWCI
- 27.39
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.