Modern programmable blockchains have built-in support for smart contracts, ie ‍programs
that are stored on the blockchain and whose state is subject to consensus. After a smart …

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 …

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 …

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 …

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

In this work, we consider the almost-sure termination problem for probabilistic programs that
asks whether a given probabilistic program terminates with probability 1. Scalable …

We study a syntax for specifying quantitative assertions—functions mapping program states
to numbers—for probabilistic program verification. We prove that our syntax is expressive in …

We study the recursion-theoretic complexity of Positive Almost-Sure Termination (PAST) in
an imperative programming language with rational variables, bounded nondeterministic …

We present a novel modular approach to infer upper bounds on the expected runtimes of
probabilistic integer programs automatically. To this end, it computes bounds on the …

Probabilistic programs extend classical imperative programs with random-value generators.
For classical non-probabilistic programs, termination is a key question in static analysis of …