The following pages link to Robbert Krebbers (Q549190):
Displaying 19 items.
- The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
- A formal C memory model for separation logic (Q1694027) (← links)
- The \(\lambda \mu^{\mathbf{T}}\)-calculus (Q1946673) (← links)
- Moessner's theorem: an exercise in coinductive reasoning in \textsc{Coq} (Q2026804) (← links)
- Aliasing Restrictions of C11 Formalized in Coq (Q2938039) (← links)
- Higher-order ghost state (Q2985775) (← links)
- The Essence of Higher-Order Concurrent Separation Logic (Q2988664) (← links)
- Iris from the ground up: A modular foundation for higher-order concurrent separation logic (Q4625160) (← links)
- Separation Logic for Non-local Control Flow and Block Scope Variables (Q4910424) (← links)
- Type classes for efficient exact real arithmetic in Coq (Q4913763) (← links)
- (Q4986734) (← links)
- (Q5094146) (← links)
- ReLoC (Q5145319) (← links)
- (Q5155670) (← links)
- Computer Certified Efficient Exact Reals in Coq (Q5200110) (← links)
- A Formalization of the C99 Standard in HOL, Isabelle and Coq (Q5200133) (← links)
- Interactive proofs in higher-order concurrent separation logic (Q5370856) (← links)
- An operational and axiomatic semantics for non-determinism and sequence points in C (Q5408409) (← links)
- Interactive and automated proofs in modal separation logic (invited talk) (Q6642972) (← links)
