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 …

Bounded linear types have proved to be useful for automated resource analysis and control
in functional programming languages. In this paper we introduce a bounded linear typing …

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 …

Static analysis of the evaluation cost of programs is an extensively studied problem that has
many important applications. However, most automatic methods for static cost analysis are …

Multi types–aka non-idempotent intersection types–have been used. to obtain quantitative
bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the …

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 …

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 …