2 citations · 7 across the 7 of their papers we have counts for
9 papers
The Best of Times, the Worst of Times: Moment-Based Analysis of Probabilistic Cost Structures
Chenyu Zhou, Di Wang, Thomas Reps
This paper studies how to compute the moments -- mean, variance, and beyond -- of the cost (e.g., running time) of certain probabilistic programs, in which local costs combine not…
Newtonian Program Analysis of Probabilistic Programs
Di Wang, Thomas Reps
Due to their quantitative nature, probabilistic programs pose non-trivial challenges for designing compositional and efficient program analyses. Many analyses for probabilistic pro…
Sound Probabilistic Inference via Guide Types
Di Wang, Jan Hoffmann, Thomas Reps
Probabilistic programming languages aim to describe and automate Bayesian modeling and inference. Modern languages support programmable inference, which allows users to customize i…
Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems
Di Wang, Jan Hoffmann, Thomas Reps
In this article, we present a semantics-level adaption of the Optional Stopping Theorem, sketch an expected-cost analysis as its application, and survey different variants of the O…
Probabilistic Resource-Aware Session Types
Ankush Das, Di Wang, Jan Hoffmann
Session types guarantee that message-passing processes adhere to predefined communication protocols. Prior work on session types has focused on deterministic languages but many mes…
Liquid Resource Types
Tristan Knoth, Di Wang, Adam Reynolds +2
This article presents liquid resource types, a technique for automatically verifying the resource consumption of functional programs. Existing resource analysis techniques trade au…