Graded modal types systems and coeffects are becoming a standard formalism to deal with
context-dependent, usage-sensitive computations, especially when combined with …

The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the
program input result in proportional changes to the program output. For probabilistic …

We study the termination problem for nondeterministic probabilistic programs. We consider
the bounded termination problem that asks whether the supremum of the expected …

Probabilistic couplings are the foundation for many probabilistic relational program logics
and arise when relating random sampling statements across two programs. In relational …

We consider the problems of statically refuting equivalence and similarity of output
distributions defined by a pair of probabilistic programs. Equivalence and similarity are two …

We present MLCERT, a novel system for doing practical mechanized proof of the
generalization of learning procedures, bounding expected error in terms of training or test …

The Fuzz programming language by Reed and Pierce uses an elegant linear type system
combined with a monad-like type to express and reason about probabilistic sensitivity …

We introduce eRHL, a program logic for reasoning about relational expectation properties of
pairs of probabilistic programs. eRHL is quantitative, ie, its pre-and post-conditions take …

Properties such as provable security and correctness for randomized programs are naturally
expressed relationally as approximate equivalences. As a result, a number of relational …

Semantics is traditionally concerned with program equivalence, in which all pairs of
programs which are not equivalent are treated the same, and simply dubbed as …