2018/04/24 by Farhad Arbab, Luís Cruz-Filipe, Arbab, Farhad +6
Computer Science · #Asynchronous communication #Choreography #Compiler #Computer science #Deadlock #FOS: Computer and information sciences #Formal Methods in Verification #Implementation #Logic, programming, and type systems #Model-Driven Software Engineering Techniques #Process (computing) #Process calculus #Programming Languages (cs.PL) #Programming language #Semantics (computer science) #cs.PL
paper · pdf · doi:10.48550/arxiv.1804.08976
arxiv created 2018/04/24 · openalex publication_date 2018/04/24 · arxiv updated 2018/04/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present Cho-Reo-graphies (CR), a new language model that unites two powerful programming paradigms for concurrent software based on communicating processes: Choreographic Programming and Exogenous Coordination. In CR, programmers specify the desired communications among processes using a choreography, and define how communications should be concretely animated by connectors given as constraint automata (e.g., synchronous barriers and asynchronous multi-casts). CR is the first choreography calculus where different communication semantics (determined by connectors) can be freely mixed; since connectors are user-defined, CR also supports many communication semantics that were previously unavailable for choreographies. We develop a static analysis that guarantees that a choreography in CR and its user-defined connectors are compatible, define a compiler from choreographies to a process calculus based on connectors, and prove that compatibility guarantees deadlock-freedom of the compiled process implementations.