Choreographies, Logically

  • Marco Carbone
  • Fabrizio Montesi
  • Carsten Schürmann
Conference paper

DOI: 10.1007/978-3-662-44584-6_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8704)
Cite this paper as:
Carbone M., Montesi F., Schürmann C. (2014) Choreographies, Logically. In: Baldan P., Gorla D. (eds) CONCUR 2014 – Concurrency Theory. CONCUR 2014. Lecture Notes in Computer Science, vol 8704. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Marco Carbone
    • 1
  • Fabrizio Montesi
    • 2
  • Carsten Schürmann
    • 1
  1. 1.IT University of CopenhagenCopenhagenDenmark
  2. 2.University of Southern DenmarkOdenseDenmark

Personalised recommendations