Data structures are critical in any data-driven scenario, but they are notoriously hard to
design due to a massive design space and the dependence of performance on workload …

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 …

There is growing interest in termination reasoning for nonlinear programs and, meanwhile,
recent dynamic strategies have shown they are able to infer invariants for such challenging …

We formally prove that closure conversion with flat environments for CPS lambda calculus is
correct (preserves semantics) and safe for time and space, meaning that produced code …

Garbage collectors relieve the programmer from manual memory management, but lead to
compiler-generated machine code that can behave differently (eg out-of-memory errors) …

We present a framework for simultaneously verifying the functional correctness and the
worst-case asymptotic time complexity of higher-order imperative programs. We build on top …

Formal frameworks for cost analysis of programs have been widely studied in the unary
setting and, to a limited extent, in the relational setting. However, many of these frameworks …

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 …

We present a framework to verify both, functional correctness and (amortized) worst-case
complexity of practically efficient algorithms. We implemented a stepwise refinement …