Formal proof with the Coq theorem prover of the correctness of an oracle algorithm for offline analysis of distributed logs against interaction models
-
Updated
May 13, 2021 - HTML
Formal proof with the Coq theorem prover of the correctness of an oracle algorithm for offline analysis of distributed logs against interaction models
Formal proof with the Coq theorem prover that elements of some equivalence classes defined over a formal language of interactions describing the behavior of distributed systems have the same semantics.
Formal proof with the Coq theorem prover of the equivalence of three semantics for a language describing the behavior of distributed systems.
Add a description, image, and links to the interaction-models topic page so that developers can more easily learn about it.
To associate your repository with the interaction-models topic, visit your repo's landing page and select "manage topics."