This paper presents a wp--style calculus for obtaining expectations on the outcomes of
(mutually) recursive probabilistic programs. We provide several proof rules to derive one …

Wir studieren die quantitative Analyse probabilistischer Programme. Dabei untersuchen wir
vornehmlich zwei Aspekte: Die Analysetechniken selbst, sowie die komplexitäts-bzw …

This article investigates the semantic intricacies of conditioning, a main feature in
probabilistic programming. Our study is based on an extension of the imperative …

We present a new inductive rule for verifying lower bounds on expected values of random
variables after execution of probabilistic loops as well as on their expected runtimes. Our …

The probabilistic guarded-command language (pGCL) contains both demonic and
probabilistic non-determinism, which makes it suitable for reasoning about distributed …

Automatically establishing that a probabilistic program satisfies some property ϕ is a
challenging problem. While a sampling-based approach—which involves running the …

We consider mixed powerdomains combining ordinary nondeterminism and probabilistic
nondeterminism. We characterise them as free algebras for suitable (in) equation-al …

We present domain-theoretic models that support both probabilistic and nondeterministic
choice. In [A. McIver and C. Morgan. Partial correctness for probablistic demonic programs …

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 …

We apply the notion of quantum predicate proposed by D'Hondt and Panangaden to
analyze a simple language fragment which may describe the quantum part of a future …