Filters








187 Hits in 5.3 sec

Precise Subtyping for Asynchronous Multiparty Sessions [article]

Silvia Ghilezan, Jovanka Pantović, Ivan Prokić, Alceste Scalas, Nobuko Yoshida
2020 arXiv   pre-print
This paper presents the first formalisation of the precise subtyping relation for asynchronous multiparty sessions.  ...  Previous work studies precise subtyping for binary sessions (with just two participants), or multiparty sessions (with any number of participants) and synchronous interaction.  ...  ACKNOWLEDGMENTS We thank the POPL reviewers for their insightful comments and suggestions, Mariangiola Dezani-Ciancaglini for her initial collaboration, and Simon Castellan for the fruitful discussion.  ... 
arXiv:2010.13925v1 fatcat:pvaazx4evvh4llarxbsw7vmh7u

Precise subtyping for asynchronous multiparty sessions

Silvia Ghilezan, Jovanka Pantović, Ivan Prokić, Alceste Scalas, Nobuko Yoshida
2021 Proceedings of the ACM on Programming Languages (PACMPL)  
We present the first formalisation of the precise subtyping relation for asynchronous multiparty sessions.  ...  This work tackles the problem of finding the precise subtyping relation ⩽ for multiparty asynchronous session types.  ...  ACKNOWLEDGMENTS We thank the POPL reviewers for their insightful comments and suggestions, Mariangiola Dezani-Ciancaglini for her initial collaboration, and Simon Castellan for the fruitful discussion.  ... 
doi:10.1145/3434297 fatcat:zyspxvsta5crlm7jwmexdvs7fm

Denotational and Operational Preciseness of Subtyping: A Roadmap [chapter]

Mariangiola Dezani-Ciancaglini, Silvia Ghilezan, Svetlana Jakšić, Jovanka Pantović, Nobuko Yoshida
2016 Lecture Notes in Computer Science  
The soundness and the completeness, together referred to as the preciseness of subtyping, can be considered from two different points of view: denotational and operational.  ...  The present paper shows that standard proofs of operational preciseness imply denotational preciseness and gives an overview on this subject.  ...  The asynchronous subtyping relation is operationally precise for the asynchronous session calculus.  ... 
doi:10.1007/978-3-319-30734-3_12 fatcat:a7d35babmbc6jgvxp5e2qk5liy

Precise subtyping for synchronous multiparty sessions

Mariangiola Dezani-Ciancaglini, Silvia Ghilezan, Svetlana Jakšić, Jovanka Pantović, Nobuko Yoshida
2016 Electronic Proceedings in Theoretical Computer Science  
The result of this paper is the operational and denotational preciseness of the subtyping for a synchronous multiparty session calculus.  ...  The soundness and the completeness, together referred to as the preciseness of subtyping, can be considered from two different points of view: operational and denotational.  ...  We are grateful to the anonymous reviewers for their useful remarks.  ... 
doi:10.4204/eptcs.203.3 fatcat:z4hf23v3hjba7d3mamtwsh63ea

Global Principal Typing in Partially Commutative Asynchronous Sessions [chapter]

Dimitris Mostrous, Nobuko Yoshida, Kohei Honda
2009 Lecture Notes in Computer Science  
We generalise a theory of multiparty session types for the π-calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal flexibility and safe optimisation  ...  A sound and complete algorithm for the subtyping relation, which can calculate conformance of optimised end-point processes to an agreed global specification, is presented.  ...  We thank the reviewers for their useful comments, Gary Brown and Steve Ross-Talbot for discussions on the potential applications of the presented framework for software development, and Matthew Rawlings  ... 
doi:10.1007/978-3-642-00590-9_23 fatcat:nhx2bvblwvazjbr6nl7ri6rmli

Undecidability of Asynchronous Session Subtyping [article]

Mario Bravetti, Marco Carbone, Gianluigi Zavattaro
2017 arXiv   pre-print
consumed, and the one by Mostrous et al. for multiparty session types.  ...  We investigate the (un)decidability of subtyping for session types in asynchronously communicating systems.  ...  We have proven that asynchronous subtyping for session types is undecidable. Moreover, we have shown that subtyping becomes decidable if we put some restrictions on the branching/selection structure.  ... 
arXiv:1611.05026v3 fatcat:ticd6qfqlnai7cx4gjvgina4je

Session Subtyping and Multiparty Compatibility Using Circular Sequents

Ross Horne, Laura Kovács, Igor Konnov
2020 International Conference on Concurrency Theory  
We present a structural proof theory for multi-party sessions, exploiting the expressive power of non-commutative logic which can capture explicitly the message sequence order in sessions.  ...  The resulting subtype system has the advantage that it can be used to capture compatibility in the multiparty setting (addressing limitations of pairwise duality).  ...  A Proof System for Subtyping and Multiparty Compatibility In this section, we introduce session types and a proof system for expressing session types called Session, which defines our subtype system for  ... 
doi:10.4230/lipics.concur.2020.12 dblp:conf/concur/Horne20 fatcat:wcxnqve55zdb7jdkodhzogmf6e

Session-Based Compilation Framework for Multicore Programming [chapter]

Nobuko Yoshida, Vasco Vasconcelos, Hervé Paulino, Kohei Honda
2009 Lecture Notes in Computer Science  
The key idea is to regard explicit asynchronous data transfer among local caches as typed communication among processes.  ...  This paper outlines a general picture of our ongoing work under EU Mobius and Sensoria projects on a type-based compilation and execution framework for a class of multicore CPUs.  ...  L1 with Multiparty Session Types We now outline how these structured dialogues can be abstracted as types for conversations in the form of multiparty session types [20] , where pure asynchrony in communication  ... 
doi:10.1007/978-3-642-04167-9_12 fatcat:vgujhc7un5adxafmyfi544lklq

Asynchronous session subtyping as communicating automata refinement

Mario Bravetti, Gianluigi Zavattaro
2021 Journal of Software and Systems Modeling  
In this way, on the one hand, we enrich the theory of session types with an operational characterization and, on the other hand, we use recent undecidability results for asynchronous session subtyping  ...  to obtain an original undecidability result for asynchronous CFSMs/behavioural contract refinement.  ...  A final interesting line for future research is about multiparty asynchronous session subtyping. The first paper introducing asynchronous session subtyping considered multiparty sessions [35] .  ... 
doi:10.1007/s10270-020-00838-x fatcat:whytw3uuvzfr3of3u7qg5xcwlm

On the Preciseness of Subtyping in Session Types

Tzu-Chun Chen, Mariangiola Dezani-Ciancaglini, Nobuko Yoshida
2014 Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14  
This paper formalises preciseness (i.e. both soundness and completeness) of subtyping for mobile processes and studies it for the synchronous and the asynchronous session calculi.  ...  We then propose an asynchronous subtyping system which is sound and complete for the asynchronous calculus.  ...  We thank Kohei Honda and Luca Padovani for their suggestions and discussions.  ... 
doi:10.1145/2643135.2643138 dblp:conf/ppdp/ChenDY14 fatcat:7cbet4s3xvfplkxq4fya4257z4

Fair Refinement for Asynchronous Session Types [chapter]

Mario Bravetti, Julien Lange, Gianluigi Zavattaro
2021 Lecture Notes in Computer Science  
In the context of session types, the most general notion of refinement is the asynchronous session subtyping, which allows to anticipate message emissions but only under certain conditions.  ...  In particular, asynchronous session subtyping rules out candidates subtypes that occur naturally in communication protocols where, e.g., two parties simultaneously send each other a finite but unspecified  ...  A Sound Algorithm for Fair Asynchronous Subtyping We propose an algorithm which soundly verifies whether a session type is a fair asynchronous subtype of another.  ... 
doi:10.1007/978-3-030-71995-1_8 fatcat:slzrcqamcrg4tpgcgsvtmevzya

Explicit Connection Actions in Multiparty Session Types [chapter]

Raymond Hu, Nobuko Yoshida
2017 Lecture Notes in Computer Science  
This work extends asynchronous multiparty session types (MPST) with explicit connection actions to support protocols with optional and dynamic participants.  ...  We discuss key implementation issues related to the proposed extensions: a practical treatment of choice subtyping for MPST progress, and multiparty correlation of dynamic binary connections.  ...  We thank Gary Brown and Steve Ross-Talbot for collaborations, and Rumyana Neykova for comments.  ... 
doi:10.1007/978-3-662-54494-5_7 fatcat:cgjqdckbbrawjfjpyu63urpvae

Session-Based Communication Optimisation for Higher-Order Mobile Processes [chapter]

Dimitris Mostrous, Nobuko Yoshida
2009 Lecture Notes in Computer Science  
For the runtime system we propose a new compact formulation that takes into account stored higher-order values with open sessions, as well as asynchronous commutativity.  ...  In this paper we solve an open problem posed in our previous work on asynchronous subtyping [12], extending the method to higher-order session communication and functions.  ...  We intend to integrate the improved methods from this work back to our original subtyping method for multiparty sessions [12] , extending it to higher-order multiparty sessions.  ... 
doi:10.1007/978-3-642-02273-9_16 fatcat:wpo2ogsewzf77dlxqifmtpqb4q

A Sound Algorithm for Asynchronous Session Subtyping and its Implementation [article]

Mario Bravetti, Marco Carbone, Julien Lange, Nobuko Yoshida, Gianluigi Zavattaro
2021 arXiv   pre-print
Unfortunately, recent work has shown that subtyping for session types in an asynchronous setting is undecidable.  ...  In practice, a very important notion for dealing with such types is that of subtyping, since it allows for typing larger classes of system, where a program has not precisely the expected behaviour but  ...  Recently precise multiparty asynchronous subtyping (in the sense of [11, 12, 20] ) for the asynchronous multiparty session π-calculus [23, 24] was proposed in [21] .  ... 
arXiv:1907.00421v5 fatcat:g4jnz5sak5de5omkrcsioik6v4

On the Expressiveness of Multiparty Sessions

Romain Demangeon, Nobuko Yoshida, Marc Herbstritt
2015 Foundations of Software Technology and Theoretical Computer Science  
This paper explores expressiveness of asynchronous multiparty sessions.  ...  We model the behaviours of endpoint implementations in several ways: (i) by the existence of different buffers and queues used to store messages exchanged asynchronously, (ii) by the ability for an endpoint  ...  Session type expressiveness This paper explores and compares expressiveness of different semantics for asynchronous multiparty sessions in the literature, based on message traces.  ... 
doi:10.4230/lipics.fsttcs.2015.560 dblp:conf/fsttcs/DemangeonY15 fatcat:wredva6edze45pm22fa6v2y5ya
« Previous Showing results 1 — 15 out of 187 results