Formal verification in Isabelle(HOL) of a sequential set-based algorithm for computing SCCs
-
Updated
Sep 22, 2022 - Isabelle
Formal verification in Isabelle(HOL) of a sequential set-based algorithm for computing SCCs
Formal verification in Isabelle(HOL) of Hopcroft's algorithm for minimizing DFAs including runtime analysis
Formalizing the KZG polynomial commitment scheme in the Interactive Theorem Prover Isabelle.
Schrödinger's hats: a puzzle about parities and permutations
Formal proofs of equivalences of different kinds of networks
High-assurance implementation of the Ouroboros protocol family
Formalisation of Ethereum consensus in Isabelle/HOL
Formalisation of MPC in Isabelle/HOL
Formalization of the Cardano ledger specification
Add a description, image, and links to the formal-methods topic page so that developers can more easily learn about it.
To associate your repository with the formal-methods topic, visit your repo's landing page and select "manage topics."