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 rapid advance of deep reinforcement learning techniques enables the oversight of
safety-critical systems through the utilization of Deep Neural Networks (DNNs). This …

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

Computing reachability probabilities is a fundamental problem in the analysis of randomized
programs. This article aims at a comprehensive and comparative account of various …

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 present a novel methodology for the automated resource analysis of non-deterministic,
probabilistic imperative programs, which gives rise to a modular approach. Program …

Programs with randomization constructs is an active research topic, especially after the
recent introduction of martingale-based analysis methods for their termination and runtimes …

Verification of higher-order probabilistic programs is a challenging problem. We present a
verification method that supports several quantitative properties of higher-order probabilistic …