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 …

The termination and complexity competition (termCOMP) focuses on automated termination
and complexity analysis for various kinds of programming paradigms, including categories …

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 a modular approach to automatic complexity analysis of integer programs.
Based on a novel alternation between finding symbolic time bounds for program parts and …

We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …

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 …

We present a modular approach to automatic complexity analysis. Based on a novel
alternation between finding symbolic time bounds for program parts and using these to infer …

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 …

Automatic amortized resource analysis (AARA) is a typebased technique for inferring
concrete (non-asymptotic) bounds on a program's resource usage. Existing work on AARA …