Andres Erbsen
where else to find them
no profile links on file
what they talk about
where they keep going back
- PLDI Workshop Honoring Andreas Podelski3 editions2023–2025
on a stage with
all 21 in the filters
who talks about the same things
- Owen Conoly2 talks
- Adam Chlipala23 talks
- Samuel Gruetter5 talks
- Jason Gross3 talks
- Dustin Jamner3 talks
- Ranjit Jhala19 talks
| title | conference | date |
|---|---|---|
| Smooth, Integrated Proofs of Cryptographic Constant Time for Nondeterministic Programs(…) | PLDI 2025 | 2025-06-16 |
Formal definition of cryptographic constant‑time for languages with compiler‑resolved nondeterminism using omnisemantics and single‑copy assertions, mechanized… | ||
| Foundational Integration Verification of a Cryptographic Server | PLDI 2024 | 2024-06-24 |
A verified bare-metal garage-door server implements authenticated open/close commands and prevents replays by rotating seeds, and a single machine-checked… | ||
| Flexible Instruction-Set Semantics via Abstract Monads | ICFP 2023 | 2023-09-04 |
Claims a single Haskell-based core semantics, parameterized by a Risk5Machine type class over monads, supports testing, interactive proof, model checking and… | ||
| CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives | PLDI 2023 | 2023-06-17 |
CryptOpt turns Fiat Cryptography IR into x86-64 assembly by running a random local search over instruction selection and scheduling, auto-benchmarking… | ||
| Certifying Derivation of State Machines from Coroutines | POPL 2022 | 2022-01-16 |
A compiler implemented as a Coq tactic turns programs written with freer-monad coroutines into explicit state-machine code by searching for equivalence proofs… | ||
| nothing matches | ||