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 …

This article presents a wp--style calculus for obtaining bounds on the expected runtime of
randomized algorithms. Its application includes determining the (possibly infinite) expected …

We consider the problem of expected cost analysis over nondeterministic probabilistic
programs, which aims at automated methods for analyzing the resource-usage of such …

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 …

This article presents a type-based analysis for deriving upper bounds on the expected
execution cost of probabilistic programs. The analysis is naturally compositional, parametric …

We present a novel methodology for the automated resource analysis of non-deterministic,
probabilistic imperative programs, which gives rise to a modular approach. Program …

We show that complexity analysis of probabilistic higher-order functional programs can be
carried out compositionally by way of a type system. The introduced type system is a …

Probabilistic recurrence relations (PRRs) are a standard formalism for describing the
runtime of a randomized algorithm. Given a PRR and a time limit κ, we consider the tail …

We define a continuation-passing style (CPS) translation for a typed λ-calculus with
probabilistic choice, unbounded recursion, and a tick operator—for modeling cost. The …

Wir studieren drei Aspekte der Programmverifikation mit Separation Logic (SL): 1. Die
Analyse quantitativer Eigenschaften, wie zB die Wahrscheinlichkeit der Terminierung ohne …