Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Dynamic multirole session types
Deniélou P., Yoshida N. ACM SIGPLAN Notices46 (1):435-446,2011.Type:Article
Date Reviewed: Apr 7 2011

Session types have been introduced to provide global static descriptions of multi-process systems by specifying abstractions of the interaction patterns among a fixed set of participants. Deniélou and Yoshida’s paper extends this approach to dynamic multi-role session types that deal with time-varying, dynamic sets of interacting processes, thanks to the notion of roles. Introducing such flexibility is key to enabling the use of session types for dynamic interaction patterns such as the ones found in peer-to-peer (P2P) and client-server architectures.

A role denotes a class of process behaviors; it is characterized by a name, such as “broker” or “client,” which appears within a global multi-party session type that specifies the overall interaction pattern of a system. This global type can be restricted to a particular local type, which is the result of selecting in the global type the elements specific to a particular role name. These roles are key to the dynamic extension of session types. The authors suggest using universal quantification over roles to refer to the varying set of participants that implement a particular role, both at the type and implementation levels. Formal static and dynamic semantics rules, correctness theorems, and a specific-locking mechanism are successively introduced to firmly set the foundations of this approach.

Despite the importance of its possible future applicability, this highly abstract and notation-heavy paper will only be of use to computer scientists well versed in the intricacies of current programming language design formalisms.

Reviewer:  P. Jouvelot Review #: CR138965 (1109-0954)
Bookmark and Share
 
Process Models (F.3.2 ... )
 
 
Parallelism And Concurrency (F.1.2 ... )
 
 
Semantics (D.3.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Process Models": Date
A tutorial on EMPA
Bernardo M., Gorrieri R. (ed) Theoretical Computer Science 202(1-2): 1-54, 1998. Type: Article
Nov 1 1998
CSP, partial automata, and coalgebras
Wolter U. Theoretical Computer Science 280(1-2): 3-34, 2002. Type: Article
Dec 18 2002
Well-behaved flow event structures for parallel composition and action refinement
van Glabbeek R., Goltz U. Theoretical Computer Science 311(1-3): 463-478, 2004. Type: Article
Sep 29 2004
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy