This paper reports our experience applying lightweight formal methods to validate the
correctness of ShardStore, a new key-value storage node implementation for the Amazon …

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 resource-guided synthesis, a technique for synthesizing recursive
programs that satisfy both a functional specification and a symbolic resource bound. The …

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 consider the problem of expected cost analysis over nondeterministic probabilistic
programs, which aims at automated methods for analyzing the resource-usage of such …

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 …

Cost analysis, also known as resource usage analysis, is the task of finding bounds on the
total cost of a program and is a well-studied problem in static analysis. In this work, we …

We present a Separation Logic with space credits for reasoning about heap space in a
sequential call-by-value lambda-calculus equipped with garbage collection and mutable …

Numerical invariants, eg, relationships among numerical variables in a program, represent a
useful class of properties to analyze programs. General polynomial invariants represent …