Dynamic Choreographies: Theory And Implementation - Archive ouverte HAL Access content directly
Journal Articles Logical Methods in Computer Science Year : 2017

Dynamic Choreographies: Theory And Implementation

(1) , (2, 3) , (2, 3) , (2, 3) , (3, 4)


Programming distributed applications free from communication deadlocks and race conditions is complex. Preserving these properties when applications are updated at runtime is even harder. We present a choreographic approach for programming updatable, distributed applications. We define a choreography language, called Dynamic Interaction-Oriented Choreography (DIOC), that allows the programmer to specify, from a global viewpoint, which parts of the application can be updated. At runtime, these parts may be replaced by new DIOC fragments from outside the application. DIOC programs are compiled, generating code for each participant in a process-level language called Dynamic Process-Oriented Choreographies (DPOC). We prove that DPOC distributed applications generated from DIOC specifications are deadlock free and race free and that these properties hold also after any runtime update. We instantiate the theoretical model above into a programming framework called Adaptable Interaction-Oriented Choreographies in Jolie (AIOCJ) that comprises an integrated development environment, a compiler from an extension of DIOCs to distributed Jolie programs, and a runtime environment to support their execution.
Fichier principal
Vignette du fichier
1611.09067.pdf (843.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01631394 , version 1 (09-11-2017)



Mila Dalla Preda, Maurizio Gabbrielli, Saverio Giallorenzo, Ivan Lanese, Jacopo Mauro. Dynamic Choreographies: Theory And Implementation. Logical Methods in Computer Science, 2017, 13, pp.1 - 57. ⟨10.23638/LMCS-13(2:1)2017⟩. ⟨hal-01631394⟩
136 View
51 Download



Gmail Facebook Twitter LinkedIn More