The following pages link to Gilles Barthe (Q236461):
Displaying 50 items.
- (Q4219052) (← links)
- (Q4222881) (← links)
- (Q4222932) (← links)
- (Q4260702) (← links)
- (Q4263801) (← links)
- (Q4362909) (← links)
- (Q4364376) (← links)
- (Q4376043) (← links)
- (Q4447243) (← links)
- Setoids in type theory (Q4457833) (← links)
- (Q4484330) (← links)
- (Q4508290) (← links)
- (Q4598248) (← links)
- Synthesizing Probabilistic Invariants via Doob’s Decomposition (Q4633526) (← links)
- Proving Differential Privacy via Probabilistic Couplings (Q4635938) (← links)
- Verifiable Side-Channel Security of Cryptographic Implementations: Constant-Time MEE-CBC (Q4639476) (← links)
- Proving uniformity and independence by self-composition and coupling (Q4645748) (← links)
- Modular properties of algebraic type systems (Q4645803) (← links)
- Implicit coercions in type systems (Q4647565) (← links)
- A two-level approach towards lean proof-checking (Q4647567) (← links)
- (Q4736986) (← links)
- (Q4738309) (← links)
- Domain-free pure type systems (Q4762953) (← links)
- (Q4785541) (← links)
- (Q4813221) (← links)
- Remarks on the equational theory of non-normalizing pure type systems (Q4819369) (← links)
- Type-checking injective pure type systems (Q4948007) (← links)
- (Q5002798) (← links)
- On the Versatility of Open Logical Relations (Q5041087) (← links)
- A simple abstract semantics for equational theories (Q5055883) (← links)
- Universal Equivalence and Majority of Probabilistic Programs over Finite Fields (Q5056363) (← links)
- (Q5111434) (← links)
- Universal equivalence and majority of probabilistic programs over finite fields (Q5145628) (← links)
- Probabilistic Couplings from Program Logics (Q5150949) (← links)
- A Tutorial on Type-Based Termination (Q5191089) (← links)
- Computer-Aided Security Proofs for the Working Cryptographer (Q5199185) (← links)
- (Q5207055) (← links)
- (Q5219933) (← links)
- EasyCrypt: A Tutorial (Q5253588) (← links)
- Formal certification of code-based cryptographic proofs (Q5261508) (← links)
- Making RSA–PSS Provably Secure against Non-random Faults (Q5265081) (← links)
- Automated Reasoning (Q5307075) (← links)
- Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs (Q5327422) (← links)
- Coupling proofs are probabilistic product programs (Q5370853) (← links)
- Relational cost analysis (Q5370869) (← links)
- CIC $\widehat{~}$ : Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions (Q5387897) (← links)
- A certified lightweight non-interference Java bytecode verifier (Q5400855) (← links)
- Probabilistic relational verification for cryptographic implementations (Q5408416) (← links)
- Fundamental Approaches to Software Engineering (Q5428882) (← links)
- Certificate Translation in Abstract Interpretation (Q5458410) (← links)
