Deadlock-freedom-by-design
Open Access
- 23 January 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 263-274
Abstract
Over the last decade, global descriptions have been successfully employed for the verification and implementation of communicating systems, respectively as protocol specifications and choreographies. In this work, we bring these two practices together by proposing a purely-global programming model. We show a novel interpretation of asynchrony and parallelism in a global setting and develop a typing discipline that verifies choreographies against protocol specifications, based on multiparty sessions. Exploiting the nature of global descriptions, our type system defines a new class of deadlock-free concurrent systems (deadlock-freedom-by-design), provides type inference, and supports session mobility. We give a notion of Endpoint Projection (EPP) which generates correct entity code (as pi-calculus terms) from a choreography. Finally, we evaluate our approach by providing a prototype implementation for a concrete programming language and by applying it to some examples from multicore and service-oriented programming.Keywords
This publication has 16 references indexed in Scilit:
- Multiparty Session Types Meet Communicating Automata2012
- Conversation typesTheoretical Computer Science, 2010
- Session-based Choreography with ExceptionsElectronic Notes in Theoretical Computer Science, 2009
- Session-Based Distributed Programming in JavaLecture Notes in Computer Science, 2008
- Multiparty asynchronous session typesACM SIGPLAN Notices, 2008
- Global Progress in Dynamically Interleaved Multiparty Sessions2008
- A formal semantics for protocol narrationsTheoretical Computer Science, 2007
- Choreography and Orchestration Conformance for System Design2006
- Realizability of Conversation Protocols with Message ContentsInternational Journal of Web Services Research, 2005
- On asynchrony in name-passing calculiMathematical Structures in Computer Science, 2004