A method for verifying choreographies and their implementations.

Abstract

A global choreography defines a communication pattern over a set of ports. The ports are partitioned into subsets, each subset being the ports that belong to a given process. From a choreography and an interaction architecture, a distributed implementation can be generated automatically. The implementation can then be analyzed for correctness using standard methods such as model checking, but this is subject to state-explosion. A more efficient approach is to verify that the choreography is correct, and to establish that the implementation automatically inherits the correctness properties of the choreography. Because the choreography is centralized, analyzing it provides a more manageable abstract view and it incurs less state explosion. We present such an approach in this thesis, along with several case studies illustrating its advantages in practice.