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.
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.
| Original language | English |
|---|---|
| Book series | Lecture Notes in Computer Science |
| Volume | 8704 |
| Pages (from-to) | 47-62 |
| Number of pages | 15 |
| ISSN | 0302-9743 |
| Publication status | Published - 2014 |
Keywords
- Choreographic Programming
- Distributed Systems
- Linear Compositional Choreographies
- Process Automation
- Semantics Reconstruction