Joost-Pieter Katoen
where else to find them
linkedin:joost-pieter-katoen-2311137
what they talk about
where they keep going back
all 5 in the filters
on a stage with
all 24 in the filters
who talks about the same things
- Benjamin Lucien Kaminski14 talks
- Kevin Batz8 talks
- Christoph Matheja8 talks
- Gilles Barthe17 talks
- Joseph Tassarotti20 talks
- Alejandro Aguirre10 talks
| title | conference | date |
|---|---|---|
| Verifying Sampling Algorithms via Distributional Invariants | LAFI 2026 | 2026-01-11 |
Framework treats probabilistic programs as distribution transformers and proves that the Fast Dice Roller and Fast Loaded Dice Roller produce the intended… | ||
| Exact Bayesian Inference for Loopy Probabilistic Programs Using Generating Functions | OOPSLA 2024 | 2024-10-20 |
Claims exact Bayesian posteriors for probabilistic programs with unbounded loops and conditioning by giving a denotational semantics based on extended… | ||
| Caesar: A Verifier for Probabilistic Programs | Dafny 2024 | 2024-01-14 |
A deductive verifier called Caesar implements a probabilistic Boogie‑style pipeline: programs, specifications and proof rules are encoded in the quantitative… | ||
| Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Progr... | POPL 2024 | 2024-01-14 |
Shows a semi-automatic method that synthesizes memoryless deterministic (MD) strategies for probabilistic imperative programs by transforming guards via… | ||
| A Deductive Verification Infrastructure for Probabilistic Programs | OOPSLA 2023 | 2023-10-23 |
A deductive verification infrastructure implements an IVL (HAV/Halo) and a real-valued logic that encodes expectation-based specs, encodings for 12 loop proof… | ||
| Lower Bounds for Possibly Divergent Probabilistic Programs | OOPSLA 2023 | 2023-10-23 |
A proof rule called guard strengthening gives sound lower bounds for weakest preexpectations of possibly divergent probabilistic loops by replacing loop guards… | ||
| Exact Probabilistic Inference Using Generating Functions | LAFI 2023 | 2023-01-15 |
Generative-function semantics represent discrete program distributions as formal power series and use multiplicative inverses to get closed-form fractions… | ||
| A Calculus for Amortized Expected Runtimes | POPL 2023 | 2023-01-15 |
Develops a weakest-precondition-style aert calculus that composes the potential method with an extended ert for dynamic memory using runtime separation logic… | ||
| Weighted programming: a programming paradigm for specifying mathematical models | OOPSLA 2022 | 2022-12-05 |
Defines an imperative language with nondeterministic branching and weighted traces parameterized by a semiring, and gives a denotational semantics via a… | ||
| Gradient-Descent for Randomized Controllers under Partial Observability | VMCAI 2022 | 2022-01-16 |
Transforms partially observable controllers into a parametric Markov chain and computes exact derivatives by building a derived weighted automaton so gradients… | ||
| Out of Control: Reducing Probabilistic Models by Control-State Elimination | VMCAI 2022 | 2022-01-16 |
Title:[VMCAI'22] Out of Control: Reducing Probabilistic Models by Control-State Elimination
Authors:Tobias Winkler, Johannes Lehmann, Joost-Pieter… | ||
| A Pre-Expectation Calculus for Probabilistic Sensitivity | POPL 2021 | 2021-01-17 |
A relational pre-expectation calculus gives computable upper bounds on the Kantorovich lifting of output distributions, proved sound and (in cases) continuous… | ||
| Relatively Complete Verification of Probabilistic Programs | POPL 2021 | 2021-01-17 |
Defines a compact grammar for non‑negative real‑valued assertions (rationals, addition, multiplication, truncated subtraction, guarded expectations, scaling… | ||
| nothing matches | ||