This paper presents a new static analysis for deriving upper bounds on the expected
resource consumption of probabilistic programs. The analysis is fully automatic and derives …

We propose a framework to prove almost sure termination for probabilistic programs with
real valued variables. It is based on ranking supermartingales, a notion analogous to …

We present a new proof rule for proving almost-sure termination of probabilistic programs,
including those that contain demonic non-determinism. An important question for a …

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 …

Probabilistic programs extend classical imperative programs with real-valued random
variables and random branching. The most basic liveness property for such programs is the …

We present Lilac, a separation logic for reasoning about probabilistic programs where
separating conjunction captures probabilistic independence. Inspired by an analogy with …

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

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

We present quantitative separation logic (QSL). In contrast to classical separation logic, QSL
employs quantities which evaluate to real numbers instead of predicates which evaluate to …

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 …