Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
-
Updated
Nov 6, 2024 - HTML
Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
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 correctness of an oracle algorithm for offline analysis of distributed logs against interaction models
Construction of the Hopf fibration in Homotopy Type Theory, using the HoTT library for Coq.
GitHub Pages website for https://github.com/Blaisorblade/dot-iris.
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 coq-formalization topic page so that developers can more easily learn about it.
To associate your repository with the coq-formalization topic, visit your repo's landing page and select "manage topics."