
Exponential Automatic Amortized Resource Analysis
Automatic amortized resource analysis (AARA) is a typebased technique f...
read it

Tight Polynomial Bounds for Loop Programs in Polynomial Space
We consider the following problem: given a program, find tight asymptoti...
read it

Exponential Amortized Resource Analysis
Automatic amortized resource analysis (AARA) is a typebased technique f...
read it

Tight Polynomial WorstCase Bounds for Loop Programs
In 2008, BenAmram, Jones and Kristiansen showed that for a simple progr...
read it

SelectivelyAmortized Resource Bounding (Extended Version)
We consider the problem of automatically proving resource bounds. That i...
read it

Liquid Resource Types
This article presents liquid resource types, a technique for automatical...
read it

Cost Analysis of Nondeterministic Probabilistic Programs
We consider the problem of expected cost analysis over nondeterministic ...
read it
Typable Fragments of Polynomial Automatic Amortized Resource Analysis
Being a fully automated technique for resource analysis, automatic amortized resource analysis (AARA) can fail in returning worstcase cost bounds of programs, fundamentally due to the undecidability of resource analysis. For programmers who are unfamiliar with the technical details of AARA, it is difficult to predict whether a program can be successfully analyzed in AARA. Motivated by this problem, this article identifies classes of programs that can be analyzed in typebased polynomial AARA. Firstly, it is shown that the set of functions that are typable in univariate polynomial AARA coincides with the complexity class PTIME. Secondly, the article presents a sufficient condition for typability that axiomatically requires every subexpression of a given program to be polynomialtime. It is proved that this condition implies typability in multivariate polynomial AARA under some syntactic restrictions.
READ FULL TEXT
Comments
There are no comments yet.