Anton Podkopaev
where else to find them
no profile links on file
what they talk about
where they keep going back
on a stage with
- Alan Jeffreyonce
- Egor Namakonovonce
- Evgenii Moiseenkoonce
all 14 in the filters
who talks about the same things
- Ori Lahav17 talks
- Mark Batty5 talks
- Soham Chakraborty7 talks
- Viktor Vafeiadis23 talks
- Simon Cooksey4 talks
- Azalea Raad27 talks
| title | conference | date |
|---|---|---|
| Relaxed Memory Concurrency Re-executed | POPL 2025 | 2025-01-19 |
Proposes XMM, an almost per‑execution semantics that enforces memory consistency by adding an in‑order execute rule and an out‑of‑order reexecute rule that… | ||
| Hydra's Heads – Anton Podkopaev | Hydra 2022 | 2022-06-02 |
Claims machine-checked correctness proofs of compilation and memory models, using Coq to turn 30-page paper proofs into a program-checked development and… | ||
| The Leaky Semicolon: Compositional Semantic Dependencies for Relaxed-Memory Conc | POPL 2022 | 2022-01-16 |
Defines a compositional event semantics that attaches preconditions and families of predicate transformers to events, so sequential composition picks a… | ||
| Making Weak Memory Models Fair | OOPSLA 2021 | 2021-10-17 |
Proposes a uniform memory fairness condition for declarative weak memory models (requires porf-acyclicity) and proves it is equivalent to natural operational… | ||
| Programming language memory models: Problems, solutions, and directions | Hydra 2020 | 2020-07-06 |
Shows why sequential consistency fails for real hardware with the Dekker's lock example (both critical sections observed on x86 unless fences are inserted) and… | ||
| nothing matches | ||