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 present a novel static analysis technique to derive higher moments for program
variables for a large class of probabilistic loops with potentially uncountable state spaces …

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

We consider the fundamental problem of reachability analysis over imperative programs
with real variables. Previous works that tackle reachability are either unable to handle …

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 …

One of the main challenges in the analysis of probabilistic programs is to compute invariant
properties that summarise loop behaviours. Automation of invariant generation is still at its …

This paper presents a program analysis method that generates program summaries
involving polynomial arithmetic. Our approach builds on prior techniques that use solvable …

We present a new approach to proving non-termination of non-deterministic integer
programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal …