Choreographies, Logically

Marco Carbone, Fabrizio Montesi, Carsten Schürmann 0001 [2014].
In proceedings of CONCUR 2014, pp. 47-62.

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},
  editor       = {Paolo Baldan and
                  Daniele Gorla},
  title        = {Choreographies, Logically},
  booktitle    = {{CONCUR} 2014 - Concurrency Theory - 25th International Conference,
                  {CONCUR} 2014, Rome, Italy, September 2-5, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8704},
  pages        = {47--62},
  publisher    = {Springer},
  year         = {2014},
  url          = {\_5},
  doi          = {10.1007/978-3-662-44584-6\_5},
  timestamp    = {Wed, 10 Jan 2024 22:27:40 +0100},
  biburl       = {},
  bibsource    = {dblp computer science bibliography,}

A PDF is available (possibly a preprint):

Download PDF