DeepAI AI Chat
Log In Sign Up

Selectively-Amortized Resource Bounding (Extended Version)

by   Tianhan Lu, et al.

We consider the problem of automatically proving resource bounds. That is, we study how to prove that an integer-valued resource variable is bounded by a given program expression. Automatic resource-bound analysis has recently received significant attention because of a number of important applications (e.g., detecting performance bugs, preventing algorithmic-complexity attacks, identifying side-channel vulnerabilities), where the focus has often been on developing precise amortized reasoning techniques to infer the most exact resource usage. While such innovations remain critical, we observe that fully precise amortization is not always necessary to prove a bound of interest. And in fact, by amortizing selectively, the needed supporting invariants can be simpler, making the invariant inference task more feasible and predictable. We present a framework for selectively-amortized analysis that mixes worst-case and amortized reasoning via a property decomposition and a program transformation. We show that proving bounds in any such decomposition yields a sound resource bound in the original program, and we give an algorithm for selecting a reasonable decomposition.


page 1

page 2

page 3

page 4


Differential Cost Analysis with Simultaneous Potentials and Anti-potentials

We present a novel approach to differential cost analysis that, given a ...

Bounded Expectations: Resource Analysis for Probabilistic Programs

This paper presents a new static analysis for deriving upper bounds on t...

Liquid Resource Types

This article presents liquid resource types, a technique for automatical...

Typable Fragments of Polynomial Automatic Amortized Resource Analysis

Being a fully automated technique for resource analysis, automatic amort...

Verifying and Synthesizing Constant-Resource Implementations with Types

We propose a novel type system for verifying that programs correctly imp...

Bounded ACh Unification

We consider the problem of unification modulo an equational theory ACh, ...

An ExpTime Upper Bound for 𝒜ℒ𝒞 with Integers (Extended Version)

Concrete domains, especially those that allow to compare features with n...