Deadlock-freedom-by-design: multiparty asynchronous global programming - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Deadlock-freedom-by-design: multiparty asynchronous global programming

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.
No file

Dates and versions

hal-00909320 , version 1 (26-11-2013)

Identifiers

  • HAL Id : hal-00909320 , version 1

Cite

Marco Carbone, Fabrizio Montesi. Deadlock-freedom-by-design: multiparty asynchronous global programming. POPL - 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - 2013, 2013, Rome, Italy. pp.263-274. ⟨hal-00909320⟩

Collections

INRIA INRIA2
72 View
0 Download

Share

Gmail Facebook X LinkedIn More