erwanm974 / coq_hibou_label_multi_trace_analysis

Formal proof with the Coq theorem prover of the correctness of an oracle algorithm for offline analysis of distributed logs against interaction models

Coq proof for a multi-trace analysis algorithm

This repository hosts a proof written in the Gallina language. We use the Coq automated theorem prover to prove the correctness of an algorithm which analyze multi-traces (sets of distributed logs) against specifications of distributed systems written in the form of interaction models (formal models that can be represented graphically in the manner of Message Sequence Charts or UML Sequence Diagrams). This proof of correctness corresponds to proving that the algorithm returns "Pass" whenever the multi-trace belongs to the semantics of the interaction model and "Fail" otherwise.

This proof accompanies a paper, published in the proceedings of the 36th Annual ACM Symposium on Applied Computing:

• A small-step approach to multi-trace checking against interactions

A web page (generated with coqdoc) presenting the proof can be accessed here.

A tool, which implements and extends upon this multi-trace analysis algorithm is available on this repository.