Pages that link to "Item:Q2802495"
From MaRDI portal
The following pages link to Probabilistic Functions and Cryptographic Oracles in Higher Order Logic (Q2802495):
Displaying 13 items.
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation (Q1687724) (← links)
- Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
- A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory (Q2102926) (← links)
- Program logic for higher-order probabilistic programs in Isabelle/HOL (Q2163157) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions (Q2798773) (← links)
- Equational Reasoning with Applicative Functors (Q2829262) (← links)
- Formalising Semantics for Expected Running Time of Probabilistic Programs (Q2829281) (← links)
- Friends with Benefits (Q2988636) (← links)
- Comprehending Isabelle/HOL’s Consistency (Q2988665) (← links)
- Effect polymorphism in higher-order logic (proof pearl) (Q5915785) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)
- Effect polymorphism in higher-order logic (proof pearl) (Q5919584) (← links)
