Cost analysis of java bytecode (2007)
Cached
Download Links
- [clip.dia.fi.upm.es]
- [www2.mta.ac.il]
- [www.clip.dia.fi.upm.es]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. of ESOP’07, volume 4421 of LNCS |
| Citations: | 55 - 28 self |
BibTeX
@INPROCEEDINGS{Albert07costanalysis,
author = {E. Albert and P. Arenas and S. Genaim and G. Puebla and D. Zanardini},
title = {Cost analysis of java bytecode},
booktitle = {In Proc. of ESOP’07, volume 4421 of LNCS},
year = {2007},
pages = {157--172},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
