Choreographies, logically

Marco Carbone, Fabrizio Montesi, Carsten Schürmann 0001 [2018].
In Distributed Comput. 31.


In Choreographic Programming, a distributed system is programmed by giving a choreography, a global description of its interactions, instead of separately specifying the behaviour of each of its processes. Process implementations in terms of a distributed language can then be automatically projected from a choreography.

We present Linear Compositional Choreographies (LCC), a proof theory for reasoning about programs that modularly combine choreographies with processes. Using LCC, we logically reconstruct a semantics and a projection procedure for programs. For the first time, we also obtain a procedure for extracting choreographies from process terms.

Additional notes
Cite (BibTeX)
Click to expand
  author       = {Marco Carbone and
                  Fabrizio Montesi and
                  Carsten Sch{\"{u}}rmann},
  title        = {Choreographies, logically},
  journal      = {Distributed Comput.},
  volume       = {31},
  number       = {1},
  pages        = {51--67},
  year         = {2018},
  url          = {},
  doi          = {10.1007/S00446-017-0295-1},
  timestamp    = {Wed, 10 Jan 2024 22:27:38 +0100},
  biburl       = {},
  bibsource    = {dblp computer science bibliography,}

A PDF is available (possibly a preprint):

Download PDF