This repository hosts a proof written in the Gallina language. We use the Coq automated theorem prover to prove the equivalence of three different semantics defined on a formal language of "interactions".
"Interactions" are formal models that specify the behavior of distributed systems in the manner of Message Sequence Charts or UML Sequence Diagrams.
A web page (generated with coqdoc) presenting the proof can be accessed here.
A tool, which makes use of one of the semantics to implements various formal verification techniques is available on this repository.