Essential tasks for the verification of probabilistic programs include bounding expected
outcomes and proving termination in finite expected runtime. We contribute a simple yet …

We revisit two well-established verification techniques, k-induction and bounded model
checking (BMC), in the more general setting of fixed point theory over complete lattices. Our …

This paper presents a quantitative program verification infrastructure for discrete
probabilistic programs. Our infrastructure can be viewed as the probabilistic analogue of …

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 …

The analysis of formal models that include quantitative aspects such as timing or
probabilistic choices is performed by quantitative verification tools. Broad and mature tool …

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

Stochastic games are a convenient formalism for modelling systems that comprise rational
agents competing or collaborating within uncertain environments. Probabilistic model …

IC3 has been a leap forward in symbolic model checking. This paper proposes PrIC3
(pronounced pricy-three), a conservative extension of IC3 to symbolic model checking of …

In this work, we provide a deterministic alternative to the stochastic variational training of
generative autoencoders. We refer to these new generative autoencoders as AutoEncoders …

We formulate, in lattice-theoretic terms, two novel algorithms inspired by Bradley's property
directed reachability algorithm. For finding safe invariants or counterexamples, the first …