This article presents a resource analysis system for OCaml programs. The system
automatically derives worst-case resource bounds for higher-order polymorphic programs …

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 …

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

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

Side channel attacks have been used to extract critical data such as encryption keys and
confidential user data in a variety of adversarial settings. In practice, this threat is addressed …

This paper addresses the problem of automatically performing resource-bound analysis,
which can help programmers understand the performance characteristics of their programs …

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 …

While there exist several successful techniques for supporting programmers in deriving
static resource bounds for sequential code, analyzing the resource usage of message …

Programming digital contracts comes with unique challenges, which include (i) expressing
and enforcing protocols of interaction,(ii) controlling resource usage, and (iii) preventing the …