activity
20172021
most citedExpected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems

2 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing 2020Show all

6 papers · 1 filter

cs.PL20202 cited

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…

cs.PL2020

Typable Fragments of Polynomial Automatic Amortized Resource Analysis

Long Pham, Jan Hoffmann

Being a fully automated technique for resource analysis, automatic amortized resource analysis (AARA) can fail in returning worst-case cost bounds of programs, fundamentally due to…

cs.PL2020

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…

cs.PL2020

Raising Expectations: Automating Expected Cost Analysis with Types

Di Wang, David M Kahn, Jan Hoffmann

This article presents a type-based analysis for deriving upper bounds on the expected execution cost of probabilistic programs. The analysis is naturally compositional, parametric…

cs.PL2020

Exponential Automatic Amortized Resource Analysis

David M Kahn, Jan Hoffmann

Automatic amortized resource analysis (AARA) is a type-based technique for inferring concrete (non-asymptotic) bounds on a program's resource usage. Existing work on AARA has focus…

cs.PL2020

Central Moment Analysis for Cost Accumulators in Probabilistic Programs

Di Wang, Jan Hoffmann, Thomas Reps

For probabilistic programs, it is usually not possible to automatically derive exact information about their properties, such as the distribution of states at a given program point…