We present a novel static analysis technique to derive higher moments for program
variables for a large class of probabilistic loops with potentially uncountable state spaces …

Cost analysis, also known as resource usage analysis, is the task of finding bounds on the
total cost of a program and is a well-studied problem in static analysis. In this work, we …

We propose a symbolic execution method for programs that can draw random samples. In
contrast to existing work, our method can verify randomized programs with unknown inputs …

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 study discrete probabilistic programs with potentially unbounded looping behaviors over
an infinite state space. We present, to the best of our knowledge, the first decidability result …

We present an exact Bayesian inference method for inferring posterior distributions encoded
by probabilistic programs featuring possibly unbounded loops. Our method is built on a …

Morgan and McIver's weakest pre-expectation framework is one of the most well-established
methods for deductive verification of probabilistic programs. Roughly, the idea is to …

We study the problem of bounding the posterior distribution of discrete probabilistic
programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in …

We present an exact Bayesian inference method for inferring posterior distributions encoded
by probabilistic programs featuring possibly unbounded looping behaviors. Our method is …

We present a new proof rule for verifying lower bounds on quantities of probabilistic
programs. Our proof rule is not confined to almost-surely terminating programs--as is the …