Yannick Zakowski
where else to find them
what they talk about
where they keep going back
all 5 in the filters
on a stage with
all 11 in the filters
who talks about the same things
- Paul He2 talks
- Steve Zdancewic19 talks
- Matthieu Sozeau14 talks
- Yizhou Zhang13 talks
- Théo Winterhalter14 talks
- Yannick Forster9 talks
| title | conference | date |
|---|---|---|
| Layers of Confluence for Actors | CPP 2026 | 2026-01-12 |
Presents a concrete proof technique that adapts de Bruijn’s induction-style confluence proof to indexed transition systems and a weak diamond property (D1/D2)… | ||
| Monadic interpreters for concurrent memory models: Executable semantics of a concurrent(…) | CPP 2025 | 2025-01-20 |
Defines an executable, layered semantics for a concurrent subset of LLVM IR implemented in Coq using CTrees and extracted to OCaml; builds an interleaving… | ||
| An abstract, certified account of Operational Game Semantics | GALOP 2024 | 2024-01-14 |
An abstract, certified account builds operational game semantics formalized in Coq and gives a generic soundness theorem for OGS that covers polarized and… | ||
| Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in C... | POPL 2023 | 2023-01-15 |
Introduces a coinductive tree datatype and a ctrees monad in Coq that models nondeterminism, recursion, and effects by three node kinds: external events and… | ||
| Formal Reasoning about Layered Monadic Interpreters | ICFP 2022 | 2022-09-11 |
Extends the Coq interaction trees (ITrees) library to characterize a class of interpretable monads obtained by applying monad transformers to ITrees, gives… | ||
| Verifying a compiler through equational means | CoqPL 2021 | 2021-01-19 |
Library code models LLVM-like IR as coinductive Interaction Trees and a companion Vellvm semantics on GitHub, represents each syntax node as an ITree with… | ||
| Verifying a compiler through equational means | POPL 2021 | 2021-01-17 |
A machine-checked methodology builds a compositional, equational semantics for an LLVM-like IR using Interaction Trees and a formal IR called VIR/Vellvm… | ||
| Weak Bisimulation via Generalized Parameterized Coinduction | CPP 2020 | 2020-01-20 |
Claims a gPaco generalization of the Paco coinduction library that adds a second parameter to fix an information‑leak in parameterized coinduction, implemented… | ||
| nothing matches | ||