Amortized Resource Analysis with Polynomial Potential A Static Inference of Polynomial Bounds for Functional Programs (Extended Version)

DMCA

Amortized Resource Analysis with Polynomial Potential A Static Inference of Polynomial Bounds for Functional Programs (Extended Version)

Cached

Download Links

by Jan Hoffmann , Martin Hofmann , Ludwig-maximilians-universität München

Citations:

26 - 9 self

BibTeX

@MISC{Hoffmann_amortizedresource,
    author = {Jan Hoffmann and Martin Hofmann and Ludwig-maximilians-universität München},
    title = {Amortized Resource Analysis with Polynomial Potential A Static Inference of Polynomial Bounds for Functional Programs (Extended Version)},
    year = {}
}

OpenURL

Abstract

Abstract. In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. This analysis has been successfully applied to many standard algorithms but is limited to bounds that are linear in the size of the input. Here we extend this system to polynomial resource bounds. An automatic amortized analysis is used to infer these bounds for functional programs without further annotations if a maximal degree for the bounding polynomials is given. The analysis is generic in the resource and can obtain good bounds on heap-space, stack-space and time usage.

Keyphrases

functional program polynomial bound amortized resource analysis polynomial potential static inference extended version many standard algorithm potential-based amortized analysis good bound polynomial resource bound bounding polynomial time usage type system maximal degree automatic amortized analysis resource consumption

DMCA