We present EzPC, a secure two-party computation (2PC) framework that generates efficient
2PC protocols from high-level, easy-to-write programs. EzPC provides formal correctness …

The rise of programmable open distributed consensus platforms based on the blockchain
technology has aroused a lot of interest in replicated stateful computations, aka smart …

This paper presents a new static analysis for deriving upper bounds on the expected
resource consumption of probabilistic programs. The analysis is fully automatic and derives …

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 …

This paper presents Themis, an end-to-end static analysis tool for finding resource-usage
side-channel vulnerabilities in Java applications. We introduce the notion of epsilon …

There are two approaches to automatically deriving symbolic worst-case resource bounds
for programs: static analysis of the source code and data-driven analysis of cost …

We present calf, ac ost-a ware l ogical f ramework for studying quantitative aspects of
functional programs. Taking inspiration from recent work that reconstructs traditional aspects …

This article presents resource-guided synthesis, a technique for synthesizing recursive
programs that satisfy both a functional specification and a symbolic resource bound. The …

We present TiML (Timed ML), an ML-like functional language with time-complexity
annotations in types. It uses indexed types to express sizes of data structures and upper …

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 …