Cited in
(34)- FindFacts
- MoSS: modular security specifications framework
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- CryptHOL: game-based proofs in higher-order logic
- Verified analysis of random binary tree structures
- EasyCrypt
- GNUC
- Autoref
- Amortized Complexity
- Ergodic theory
- Density Compiler
- Monomorphic Monad
- LLL Factorization
- QuickSort Cost
- Random BSTs
- Root Balanced Tree
- Ordinals Cardinals
- Zoo Probabilistic Systems
- Treaps
- ProofPeer
- Regex_Equivalence
- Game_Based_Crypto
- MFMC_Countable
- Monad normalisation
- Probabilistic_While
- Probabilistic_Prime_Tests
- Quotients of Bounded Natural Functors
- Relational parametricity and quotient preservation for modular (co)datatypes
- scientific article; zbMATH DE number 7471712 (Why is no real title available?)
- Verified analysis of random binary tree structures
- MoSS
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- EasyUC
- Smooth_Manifolds
This page was built for software: CryptHOL
