In today's programmable blockchains, smart contracts are limited to being deterministic and
non-probabilistic. This lack of randomness is a consequential limitation, given that a wide …

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 …

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 reachability analysis over imperative programs
with real variables. Previous works that tackle reachability are either unable to handle …

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

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 …

Shortest Path Algorithms (SPAs) are established for solving shortest path problem (SPP)
mainly classified into various types. Advanced concepts are derived for solving the problem …

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 …

In reinforcement learning, an agent incrementally refines a behavioral policy through a
series of episodic interactions with its environment. This process can be characterized as …