Recent Publications

. A Denotational Semantics for Nondeterminism in Probabilistic Programs. Working paper, 2018.

PDF

. PMAF: An Algebraic Framework for Static Analysis of Probabilistic Programs. Working paper, 2017.

PDF

. Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization. In ESOP, 2017.

PDF Artifact

Recent Posts

Suppose you have a toy specification with built-in nondeterminism, and you want to generate answers with respect to the specification: type exp = EInt of int | EPair of exp * exp | ENdet of exp * exp type ans = VInt of int | VPair of ans * ans For example, from the following specification EPair (ENdet (EInt 5) (EInt 6)) (ENdet (EInt 7) (EInt 8)) one might want to generate a bunch of possible answers:

CONTINUE READING

Contact

  • diw3@cs.cmu.edu
  • GHC 7505, Carnegie Mellon University, Pittsburgh, PA 15213, USA