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 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 a type-based analysis for deriving upper bounds on the expected
execution cost of probabilistic programs. The analysis is naturally compositional, parametric …

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 …

We present decalf, ad irected, e ffectful c ost-a ware l ogical f ramework for studying
quantitative aspects of functional programs with effects. Like calf, the language is based on a …

A software analysis is a computer program that takes some representation of a software
product as input and produces some useful information about that product as output. A …

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 …

Amortized analysis is a program cost analysis technique for data structures in which the cost
of operations is specified in aggregate, under the assumption of continued sequential use …

We present a novel method for working with the physicist's method of amortized resource
analysis, which we call the quantum physicist's method. These principles allow for more …

The goal of automatic resource bound analysis is to statically infer symbolic bounds on the
resource consumption of the evaluation of a program. A longstanding challenge for …