Automatic complexity analysis

Rosendahl, Mads

doi:10.1145/99370.99381

Cited by 133 publications

(74 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our starting point is the well-developed technique of extracting recurrence relations that express resource usage functions [32,25,6,5,7,1]. These are then solved to get a closed-form function expressing the (bounds on) parameterised resource usage.…”

Section: Introductionmentioning

confidence: 99%

A Transformational Approach to Parametric Accumulated-Cost Static Profiling

Haemmerlé

López-García

Liqat

et al. 2016

Functional and Logic Programming

View full text Add to dashboard Cite

Abstract. Traditional static resource analyses estimate the total resource usage of a program, without executing it. In this paper we present a novel resource analysis whose aim is instead the static profiling of accumulated cost, i.e., to discover, for selected parts of the program, an estimate or bound of the resource usage accumulated in each of those parts. Traditional resource analyses are parametric in the sense that the results can be functions on input data sizes. Our static profiling is also parametric, i.e., our accumulated cost estimates are also parameterized by input data sizes. Our proposal is based on the concept of cost centers and a program transformation that allows the static inference of functions that return bounds on these accumulated costs depending on input data sizes, for each cost center of interest. Such information is much more useful to the software developer than the traditional resource usage functions, as it allows identifying the parts of a program that should be optimized, because of their greater impact on the total cost of program executions. We also report on our implementation of the proposed technique using the CiaoPP program analysis framework, and provide some experimental results.

show abstract

Section: Introductionmentioning

confidence: 99%

A Transformational Approach to Parametric Accumulated-Cost Static Profiling

Haemmerlé

López-García

Liqat

et al. 2016

Functional and Logic Programming

View full text Add to dashboard Cite

show abstract

“…Cost analysis has been intensively studied in the context of declarative (see, e.g., [17,16,18,12,5] for functional programming and [10,11] for logic programming) and high-level imperative programming languages (mainly focused on the estimation of worst case execution times and the design of cost models [23]). Traditionally, cost analysis has been formulated at the source level.…”

Section: Introductionmentioning

confidence: 99%

Cost Analysis of Java Bytecode

Albert

Arenas

Genaim

et al. 2007

Programming Languages and Systems

118

201

View full text Add to dashboard Cite

Abstract. Cost analysis of Java bytecode is complicated by its unstructured control flow, the use of an operand stack and its object-oriented programming features (like dynamic dispatching). This paper addresses these problems and develops a generic framework for the automatic cost analysis of sequential Java bytecode. Our method generates cost relations which define at compile-time the cost of programs as a function of their input data size. To the best of our knowledge, this is the first approach to the automatic cost analysis of Java bytecode.

show abstract

“…This set of equations can be regarded as recurrence relations (RRs for short). Equivalently, it can be regarded as time bound programs [22]. The aim of the second phase is to obtain a non-recursive representation of the equations, known as closed form.…”

Section: Introductionmentioning

confidence: 99%

“…There are a number of cost analyses available which are based on this approach and which can handle a range of programming languages, including functional [25,18,22,24,23,7], logic [12,20], and imperative [1,3]. While in all such analyses the first phase is studied in detail, the second phase has received comparatively less attention.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis

et al.

View full text Add to dashboard Cite

Abstract. The classical approach to automatic cost analysis consists of two phases. Given a program and some measure of cost, we first produce recurrence relations (RRs) which capture the cost of our program in terms of the size of its input data. Second, we convert such RRs into closed form (i.e., without recurrences). Whereas the first phase has received considerable attention, with a number of cost analyses available for a variety of programming languages, the second phase has received comparatively little attention. In this paper we first study the features of RRs generated by automatic cost analysis and discuss why existing computer algebra systems are not appropriate for automatically obtaining closed form solutions nor upper bounds of them. Then we present, to our knowledge, the first practical framework for the fully automatic generation of reasonably accurate upper bounds of RRs originating from cost analysis of a wide range of programs. It is based on the inference of ranking functions and loop invariants and on partial evaluation.

show abstract

Automatic complexity analysis

Cited by 133 publications

References 15 publications

A Transformational Approach to Parametric Accumulated-Cost Static Profiling

A Transformational Approach to Parametric Accumulated-Cost Static Profiling

Cost Analysis of Java Bytecode

Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis

Contact Info

Product

Resources

About