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 …

We consider the quantitative problem of obtaining lower-bounds on the probability of
termination of a given non-deterministic probabilistic program. Specifically, given a non …

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

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 …

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 consider the problem of expected cost analysis over nondeterministic probabilistic
programs, which aims at automated methods for analyzing the resource-usage of such …

Computing reachability probabilities is a fundamental problem in the analysis of randomized
programs. This article aims at a comprehensive and comparative account of various …

We present the first machine learning approach to the termination analysis of probabilistic
programs. Ranking supermartingales (RSMs) prove that probabilistic programs halt, in …

We consider the fundamental problem of deriving quantitative bounds on the probability that
a given assertion is violated in a probabilistic program. We provide automated algorithms …