Message-Observing Sessions-Reference-Cited by-同舟云学术

Message-Observing Sessions

Published:2024-04-29 Issue:OOPSLA1 Volume:8 Page:1351-1379
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Kavanagh Ryan¹^ORCID,Pientka Brigitte²^ORCID

Affiliation:

1. Université du Québec à Montréal, Montréal, Canada

2. McGill University, Montréal, Canada

Abstract

We present Most, a process language with message-observing session types. Message-observing session types extend binary session types with type-level computation to specify communication protocols that vary based on messages observed on other channels. Hence, Most allows us to express global invariants about processes, rather than just local invariants, in a bottom-up, compositional way. We give Most a semantic foundation using traces with binding, a semantic approach for compositionally reasoning about traces in the presence of name generation. We use this semantics to prove type soundness and compositionality for Most processes. We see this as a significant step towards capturing message-dependencies and providing more precise guarantees about processes.

Funder

Natural Sciences and Engineering Research Council of Canada

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3649859

Reference27 articles.

1. Robert Atkey. 2017. “ Observed Communication Semantics for Classical Processes”. In: Programming Languages and Systems (Lecture Notes in Computer Science) 10201. 26th European Symposium on Programming. ESOP 2017 ( Uppsala, Sweden, Apr. 22-29, 2017 ). Ed. by Hongseok Yang. Springer-Verlag GmbH Germany, Berlin, Germany, 56-82. isbn: 978-3-662-54434-1. https://doi.org/10.1007/978-3-662-54434-1_3. 10.1007/978-3-662-54434-1_3

2. Stephanie Balzer and Frank Pfenning. Sept. 2017. “ Manifest Sharing With Session Types”. Proceedings of the ACM on Programming Languages, 1, ICFP, ( Sept. 2017 ), 37. https://doi.org/10.1145/3110281. 10.1145/3110281

3. Luís Caires and Frank Pfenning. 2010. “ Session Types as Intuitionistic Linear Propositions”. In: CONCUR 2010-Concurrency Theory (Lecture Notes in Computer Science ) 6269. 21st International Conference, CONCUR 2010 (Paris, France, Aug. 31-Sept. 3, 2010 ). Ed. by Paul Gastin and François Laroussinie. Springer-Verlag Berlin Heidelberg, 222-236. isbn: 978-3-642-15374-7. https://doi.org/10.1007/978-3-642-15375-4_16. 10.1007/978-3-642-15375-4_16

4. Luís Caires Frank Pfenning and Bernardo Toninho. Mar. 2016. “ Linear Logic Propositions As Session Types”. Mathematical Structures in Computer Science 26 3 ( Mar. 2016 ) 367-423. Behavioural Types Part 2. https://doi.org/10.1017/s09601295140 00218. 10.1017/s0960129514000218

5. Iliano Cervesato and Andre Scedrov. Oct. 2009. “ Relating State-Based and Process-Based Concurrency Through Linear Logic (Full-Version)”. Information and Computation, 207, 10, (Oct. 2009 ), 1044-1077. Special Issue: 13th Workshop on Logic, Language, Information and Computation (WoLLIC 2006 ). https://doi.org/10.1016/j.ic. 2008. 11.006. 10.1016/j.ic.2008.11.006