Reasoning about Choreographic Programs
Preprint
Abstract
Choreographic programming is a paradigm where a concurrent or distributed system is developed in a top-down fashion. Programs, called choreographies, detail the desired interactions between processes, and can be compiled to distributed implementations based on message passing. Choreographic languages usually guarantee deadlock-freedom and provide an operational correspondence between choreographies and their compiled implementations, but until now little work has been done on verifying other properties. This paper presents a Hoare-style logic for reasoning about the behaviour of choreographies, and illustrate its usage in representative examples. We show that this logic is sound and complete, and discuss decidability of its judgements. Using existing results from choreographic programming, we show that any functional correctness property proven for a choreography also holds for its compiled implementation.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Functional Choreographic Programming2022
- A Predicate Transformer for Choreographies2022
- Certifying Choreography Compilation2021
- Fifty years of Hoare’s logicFormal Aspects of Computing, 2019
- Procedural Choreographic Programming2017
- Enforcing Availability in Failure-Aware Communicating Systems2016
- Compositional Choreographies2013
- Session Types as Intuitionistic Linear Propositions2010
- A Theory of Design-by-Contract for Distributed Multiparty Interactions2010
- A proof technique for communicating sequential processesActa Informatica, 1981