~/talk

Probabilistic Refinement Session Types

Talkat PLDI 2025 · 2025-06-16..06-20· [compilers-and-language-design]
links:none on file
links:none on file
slides:none on file

Introduces PReST, a core calculus that generalizes probabilistic session types to symbolic probabilities and proves type safety, global progress, probability consistency and an expected cost bound while remaining a conservative extension of refinement session types. Implements a prototype in OCaml with a bi-directional OCaml checker that emits SMT queries to Z3 and CVC5; Z3 solves benchmarks within 0.3s while CVC5 often times out. Shows a flip primitive, a unat uniform encoding for 0..n, and static verification of PMFs and composed distributions on distributed protocols and Markov chains.

AI-written summary · about

  1. 0:00PRESS language intro
  2. 2:38Motivation for probabilistic refinement
  3. 5:48Flip primitive and type checking
  4. 9:01Probability distributions in PRESS
  5. 12:37Verifying uniform distribution
  6. 15:09Crowd forwarding protocol
  7. 16:17Metatheory and guarantees
  8. 17:19PRESS type checker implementation
  9. 18:23Future work and conclusion
  10. 19:29Q&A
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.