We develop a weakest-precondition-style calculus à la Dijkstra for reasoning about
amortized expected runtimes of randomized algorithms with access to dynamic memory …

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 …

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 …

Hoare logic provides a syntax-oriented method to reason about program correctness and
has been proven effective in the verification of classical and probabilistic programs. Existing …

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 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 …

In this paper, we present the first fully-automated expected amortised cost analysis of self-
adjusting data structures, that is, of randomised splay trees, randomised splay heaps and …

The termination behavior of probabilistic programs depends on the outcomes of random
assignments. Almost sure termination (AST) is concerned with the question whether a …

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 …