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

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 …

A central method for analyzing the asymptotic complexity of a functional program is to extract
and then solve a recurrence that expresses evaluation cost in terms of input size. The …

Union-Find is a famous example of a simple data structure whose amortized asymptotic time
complexity analysis is nontrivial. We present a Coq formalization of this analysis, following …

The main way of analysing the complexity of a program is that of extracting and solving a
recurrence that expresses its running time in terms of the size of its input. We develop a …

In this paper we present v3. 0, the latest version of our fully automated complexity analyser.
implements our framework for automated complexity analysis and focuses on extensibility …

Lazy evaluation is a powerful tool that enables better compositionality and potentially better
performance in functional programming, but it is challenging to analyze its computation cost …

Union-Find is a famous example of a simple data structure whose amortized asymptotic time
complexity analysis is non-trivial. We present a Coq formalization of this analysis. Moreover …

A typical way of analyzing the time complexity of functional programs is to extract a
recurrence expressing the running time of the program in terms of the size of its input, and …

We present a new approach for specifying and verifying resource utilization of higher-order
functional programs that use lazy evaluation and memoization. In our approach, users can …