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 2018Show all

2 papers · 1 filter

cs.PL2018

Parallel Complexity Analysis with Temporal Session Types

Ankush Das, Jan Hoffmann, Frank Pfenning

We study the problem of parametric parallel complexity analysis of concurrent, message-passing programs. To make the analysis local and compositional, it is based on a conservative…

cs.PL2018

Verifying and Synthesizing Constant-Resource Implementations with Types

Van Chan Ngo, Mario Dehesa-Azuara, Matthew Fredrikson +1

We propose a novel type system for verifying that programs correctly implement constant-resource behavior. Our type system extends recent work on automatic amortized resource analy…