Aurèle Barrière
where else to find them
no profile links on file
what they talk about
where they keep going back
- POPL3 editions2021–2026
on a stage with
all 6 in the filters
who talks about the same things
- David Pichardie8 talks
- Clément Pit-Claudel17 talks
- Sandrine Blazy6 talks
- Gilles Barthe17 talks
- Adam Chlipala23 talks
- Michael Sammler16 talks
| title | conference | date |
|---|---|---|
| Formal Verification for JavaScript Regular Expressions: A Proven Mechanized Semantics(…) | POPL 2026 | 2026-01-11 |
Paper presents a mechanized, ECMAScript‑faithful semantics for JavaScript regexes in the Rocq proof assistant, equating a concise 21 inductive rules semantics… | ||
| Linear Matching of JavaScript Regular Expressions | PLDI 2024 | 2024-06-24 |
Presents a proof that a much larger subset of JavaScript regexes admits linear-time matching, identifies semantic bugs and superlinear cases in V8’s linear… | ||
| Formally Verified Native Code Generation in an Effectful JIT: Turning the CompCe... | POPL 2023 | 2023-01-15 |
Prototype JIT is implemented and mechanically verified in Coq, reusing the CompCert backend and its correctness proofs to generate x86 code, and modeling… | ||
| Formally Verified Speculation and Deoptimization in a JIT Compiler | POPL 2021 | 2021-01-17 |
A formal model defines a JIT’s middle end, an RTL-like IR and two concrete speculative ops: the anchor instruction which marks safe deoptimization points and… | ||
| Towards Formally Verified Just-In-Time Compilation | CoqPL 2020 | 2020-01-25 |
A Coq-based JIT middle-end prototype implements an RTL-like IR with an assume instruction (from Suya) to encode speculative checks, plus passes for speculation… | ||
| nothing matches | ||