The following pages link to F* (Q39279):
Displayed 18 items.
- Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
- Formal methods for web security (Q511944) (← links)
- Combining behavioural types with security analysis (Q890614) (← links)
- Program synthesis for interactive-security systems (Q1696589) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory (Q2228439) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- A Classical Realizability Model for a Semantical Value Restriction (Q2802494) (← links)
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic (Q2802495) (← links)
- A Gentle Introduction to Multiparty Asynchronous Session Types (Q2822666) (← links)
- Information Flow Analysis for Valued-Indexed Data Security Compartments (Q2830034) (← links)
- Cryptographic Verification by Typing for a Sample Protocol Implementation (Q3092172) (← links)
- Proof-Carrying Code in a Session-Typed Process Calculus (Q3100198) (← links)
- Unified Syntax with Iso-types (Q3179296) (← links)
- I Got Plenty o’ Nuttin’ (Q3188289) (← links)
- A Delta for Hybrid Type Checking (Q3188298) (← links)
- Dijkstra monads for free (Q5370885) (← links)
- The essence of ornaments (Q5372005) (← links)