Dynamic Choreographies: Theory And Implementation

Mila Dalla Preda, Maurizio Gabbrielli, Saverio Giallorenzo, Ivan Lanese, Jacopo Mauro

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

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.

Original languageEnglish
JournalLogical Methods in Computer Science
Volume13
Issue number2
Number of pages57
DOIs
Publication statusPublished - 2017
Externally publishedYes

Keywords

  • Adaptable systems
  • Choreographies
  • Deadlock freedom

Fingerprint

Dive into the research topics of 'Dynamic Choreographies: Theory And Implementation'. Together they form a unique fingerprint.

Cite this