Steven Holtzen
where else to find them
bluesky:sholtzen.bsky.social
what they talk about
where they keep going back
- PLDI Workshop Honoring Andreas Podelski4 editions2023–2026
- LAFI3 editions2023–2026
- OOPSLA2 editions2020–2025
on a stage with
all 16 in the filters
who talks about the same things
- John M. Li4 talks
- Todd Millstein11 talks
- Jack Czenszak4 talks
- Guy Van den Broeck8 talks
- Yizhou Zhang13 talks
- Joseph Tassarotti20 talks
| title | conference | date |
|---|---|---|
| Categorical Semantics of Probabilistic Symbolic Execution | PLDI 2026 | 2026-06-15 |
Builds a denotational universe where symbolic execution is a presheaf model and proves a single metatheorem: any definitional interpreter written in the… | ||
| Towards an Equational Calculus of Interventions | LAFI 2026 | 2026-01-11 |
Presents a typed equational theory that rewrites interventions in probabilistic programs into equivalent do‑free programs by replacing mechanisms with a free… | ||
| Scaling Optimization Over Uncertainty via Compilation | OOPSLA 2025 | 2025-10-16 |
Presents a compilation pipeline that turns loop-free probabilistic programs into a new IR — binary decision diagrams weighted by a branch-and-bound semiring —… | ||
| Multi-Language Probabilistic Programming | OOPSLA 2025 | 2025-10-16 |
Introduces MultiPPL, a multi-language that stitches an exact-discrete engine (DICE / BDD knowledge compilation) to an approximate sampler (K with importance… | ||
| Roulette: A Language for Expressive, Exact, and Efficient Discrete Probabilistic(…) | PLDI 2025 | 2025-06-16 |
Roulette claims to be the first discrete PPL that pairs exact, scalable inference with a large subset of Racket features (data structures, first‑class… | ||
| Bit Blasting Probabilistic Programs | PLDI 2024 | 2024-06-24 |
Presents a new discretization called bit blasting that encodes continuous variables as Boolean bits so a domain of 2^b points becomes a discrete program over… | ||
| A Multi-language Approach to Probabilistic Program Inference | LAFI 2024 | 2024-01-14 |
Claims a first probabilistic multilanguage that composes languages with different inference runtimes (example: Dice for discrete, Pyro for continuous) by… | ||
| Towards a Categorical Model of the Lilac Separation Logic | LAFI 2024 | 2024-01-14 |
Constructs two categories—a probabilistic “sheaf/topos–style” category and a nominal-style category—and proves they are equivalent, so Lilac’s independent… | ||
| Lilac: A Modal Separation Logic for Conditional Probability | PLDI 2023 | 2023-06-17 |
Lilac presents a separation logic that models probability spaces as heap-like resources and defines an independent combination operator that interprets… | ||
| Bit-Blasting Probabilistic Programs | LAFI 2023 | 2023-01-15 |
HyBit converts continuous variables into a discrete bitblasted representation by encoding each real as independent Bernoulli bits, then runs exact inference… | ||
| New foundations for probabilistic separation logic | LAFI 2023 | 2023-01-15 |
Proposes a new separation-logic semantics where propositions are sets of probability spaces and heaps are replaced by probability-space fragments combined with… | ||
| Scaling Exact Inference for Discrete Probabilistic Programs | OOPSLA 2020 | 2020-11-15 |
Introduces Dice as a discrete PPL that compiles programs to binary decision diagrams and performs inference by weighted model counting, reusing compiled… | ||
| nothing matches | ||