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

We study the problem of automatically analyzing the worst-case resource usage of
procedures with several arguments. Existing automatic analyses based on amortization or …

We study the problem of automatically analyzing the worst-case resource usage of
procedures with several arguments. Existing automatic analyses based on amortization, or …

We describe a new automatic static analysis for determining upper-bound functions on the
use of quantitative resources for strict, higher-order, polymorphic, recursive programs …

Abstract In 2003, Hofmann and Jost introduced a type system that uses a potential-based
amortized analysis to infer bounds on the resource consumption of (first-order) functional …

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 …

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 …

A primary feature of a computer program is its quantitative performance characteristics: the
amount of resources such as time, memory, and power the program needs to perform its …

Bounding resource usage is important for a number of areas, notably real-time embedded
systems and safety-critical systems. In this paper, we present a fully automatic static type …

This paper describes the first successful attempt, of which we are aware, to define an
automatic, type-based static analysis of resource bounds for lazy functional programs. Our …