Name
Abstract | ||
|---|---|---|
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost relations which define the cost of programs as a function of their input data size. The purpose of this paper is to assess the practicality of such cost analysis by experimentally evaluating a prototype analyzer implemented in Ciao. With this aim, we approximate the computational complexity of a set of selected benchmarks, including both well-known algorithms which have been used to evaluate existing cost analyzers in other programming paradigms, and other benchmarks which illustrate object-oriented features. In our evaluation, we first study whether the generated cost relations can be automatically solved. Our experiments show that in some cases the inferred cost relations can be automatically solved by using the Mathematica system, whereas, in other cases, some prior manipulation is required for the equations to be solvable. Moreover, we experimentally evaluated the running time of the different phases of the analysis process. Overall, we believe our experiments show that the efficiency of our cost analysis is acceptable, and that the obtained cost relations are useful in practice since, at least in our experiments, it is possible to get a closed form solution. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.entcs.2007.02.061 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
complexity.,complexity,java bytecode,cost analysis,recurrence equations,existing cost analyzer,cost relations,closed form solution,different phase,selected benchmarks,cost relation,analysis process,computational complexity,mathematica system,object oriented,programming paradigm | Programming language,Programming paradigm,Computer science,Closed-form expression,Theoretical computer science,Recurrence equations,Java bytecode,Cost analysis,Spectrum analyzer,Computational complexity theory | Journal |
Volume | Issue | ISSN |
190 | 1 | Electronic Notes in Theoretical Computer Science |
Citations | PageRank | References |
9 | 0.67 | 11 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| E. Albert | 1 | 127 | 7.92 |
| P. Arenas | 2 | 117 | 4.80 |
| S. Genaim | 3 | 112 | 4.94 |
| Germán Puebla | 4 | 1478 | 76.38 |
| Damiano Zanardini | 5 | 324 | 16.83 |