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 …

Establishing quantitative bounds on the execution cost of programs is essential in many
areas of computer science such as complexity analysis, compiler optimizations, security and …

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 …

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 presents λ-amor, a new type-theoretic framework for amortized cost analysis of
higher-order functional programs and shows that existing type systems for cost analysis can …

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 …