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 …

Template-based synthesis, also known as sketching, is a localized approach to program
synthesis in which the programmer provides not only a specification, but also a high-level" …

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 …

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 …

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 …

To prevent DoS attacks, Ethereum assigns a fixed gas cost to every atomic operation in the
EVM and the party who creates a transaction has to pay for its overall gas usage. While the …

We consider the classical problem of invariant generation for programs with polynomial
assignments and focus on synthesizing invariants that are a conjunction of strict polynomial …

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 …