Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Cost Analysis of Java Bytecode , P. Arenas1
 

Summary: Cost Analysis of Java Bytecode
E. Albert1
, P. Arenas1
, S. Genaim2
, G. Puebla2
, and D. Zanardini2
1
DSIC, Complutense University of Madrid, E-28040 Madrid, Spain
2
CLIP, Technical University of Madrid, E-28660 Boadilla del Monte, Madrid, Spain
Abstract. Cost analysis of Java bytecode is complicated by its unstruc-
tured 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 Introduction
Cost analysis has been intensively studied in the context of declarative (see, e.g.,

  

Source: Arenas, Puri - Facultad de Informática, Universidad Politécnica de Madrid

 

Collections: Computer Technologies and Information Sciences