Efficient Session Type Guided Distributed Interaction

Sivaramakrishnan, KC; Nagaraj, Karthik; Ziarek, Lukasz; Eugster, Patrick

doi:10.1007/978-3-642-13414-2_11

Cited by 14 publications

(12 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here we discuss closely related work. Hu et al [16] developed Session Java (SJ) with binary session types for socket programming, which was further extended with multiparty session types by Sivaramakrishnan et al [34]. Both works statically verify the extended Java source code to ensure the lack of communication errors.…”

Section: Verification Of Concurrent Programs Based On Session Typesmentioning

confidence: 99%

Static deadlock detection for concurrent go by global session graph synthesis

Yoshida

2016

Proceedings of the 25th International Conference on Compiler Construction

View full text Add to dashboard Cite

Go is a programming language developed at Google, with channelbased concurrent features based on CSP. Go can detect global communication deadlocks at runtime when all threads of execution are blocked, but deadlocks in other paths of execution could be undetected. We present a new static analyser for concurrent Go code to find potential communication errors such as communication mismatch and deadlocks at compile time. Our tool extracts the communication operations as session types, which are then converted into Communicating Finite State Machines (CFSMs). Finally, we apply a recent theoretical result on choreography synthesis to generate a global graph representing the overall communication pattern of a concurrent program. If the synthesis is successful, then the program is free from communication errors.We have implemented the technique in a tool, and applied it to analyse common Go concurrency patterns and an open source application with over 700 lines of code.

show abstract

Section: Verification Of Concurrent Programs Based On Session Typesmentioning

confidence: 99%

Static deadlock detection for concurrent go by global session graph synthesis

Yoshida

2016

Proceedings of the 25th International Conference on Compiler Construction

View full text Add to dashboard Cite

show abstract

“…This work introduced a multirole session type discipline for validating dynamic behaviours among an unspecified number of participants, answering a well-known open problem of multiparty session types [4,6,9,14,19,22,29,35]. Dynamism is formalised through a powerful universal type construct which can represent many collective communications protocols, ranging over parallel computations, P2P networking, chat protocols and e-commerce auctions.…”

Section: Discussionmentioning

confidence: 99%

“…The original binary theory has been generalised to multiparty session types [19] in order to guarantee stronger conformance to stipulated session structures between cooperating multiple end-point participants. Since the first work [19] was proposed, the multiparty session type theory has been developed in process calculi [4,10,14,22], and used in several different contexts such as distributed object communication optimisations [29], security [5,9], design by contract [6], parallel and web service programming [25,35,36] and medical guidelines [23], some of which initiated industrial collaborations (see § 6 and 7). While many interaction patterns can be captured in the existing multiparty sessions framework, there are significant limitations for describing and validating loosely-coupled, ungoverned, dynamic protocols, since the number of participants is required to be fixed both when the session is designed and when the session execution starts.…”

Section: Introductionmentioning

confidence: 99%

Dynamic multirole session types

Deniélou

Yoshida

2011

Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

Multiparty session types enforce structured safe communications between several participants, as long as their number is fixed when the session starts. In order to handle common distributed interaction patterns such as cloud algorithms or peer-to-peer protocols, we propose a new role-based multiparty session type theory where roles are defined as classes of local behaviours that an arbitrary number of participants can dynamically join and leave. We offer programmers a polling operation that gives access to the current set of a role's participants in order to fork processes. Our type system with universal types for polling can handle this dynamism and retain type safety. A multiparty locking mechanism is introduced to provide communication safety, but also to ensure a stronger progress property for joining participants that has never been guaranteed in previous systems. Finally, we present some implementation mechanisms used in our prototype extension of ML.

show abstract

“…Recently the theory of multiparty session types has been applied in different contexts, including protocol optimisation for distributed objects [38]; integrity of session interactions [7,10]; type-safe asynchronous event programming [25]; safe and efficient parallel programming [32,43]; multicore programming [44]; and medical guidelines [33]. Many of these studies are inspired by and/or inspire our industrial collaborations.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Scribbling Interactions with a Formal Foundation

Honda

Mukhamedov

Brown

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we discuss our ongoing endeavour to apply notations and algorithms based on the π-calculus and its theories for the development of large-scale distributed systems. The execution of a largescale distributed system consists of many structured conversations (or sessions) whose protocols can be clearly and accurately specified using a theory of types for the π-calculus, called session types. The proposed methodology promotes a formally founded, and highly structured, development framework for modelling and building distributed applications, from high-level models to design and implementation to static checking to runtime validation. At the centre of this methodology is a formal description language for representing protocols for interactions, called Scribble. We illustrate the usage and theoretical basis of this language through use cases from different application domains.

show abstract

Efficient Session Type Guided Distributed Interaction

Cited by 14 publications

References 16 publications

Static deadlock detection for concurrent go by global session graph synthesis

Static deadlock detection for concurrent go by global session graph synthesis

Dynamic multirole session types

Scribbling Interactions with a Formal Foundation

Contact Info

Product

Resources

About