A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis

Software Engineering, pp. 745-761, 2014.

Cited by: 80|Bibtex|Views17|Links
EI

Abstract:

We present the first scalable bound analysis that achieves amortized complexity analysis. In contrast to earlier work, our bound analysis is not based on general purpose reasoners such as abstract interpreters, software model checkers or computer algebra tools. Rather, we derive bounds directly from abstract program models, which we obtai...More

Code:

Data:

Your rating :
0

 

Tags
Comments