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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Albert, E., Arenas, P., Genaim, S., Puebla, G., & Zanardini, D. (2007). Cost analysis of Java bytecode. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4421 LNCS, pp. 157–172). Springer Verlag. https://doi.org/10.1007/978-3-540-71316-6_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
