Removing useless variables in cost analysis of Java bytecode

Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in order to decide whether to reject mobile code which has too large cost requirements in terms of computing resources (in time and/or space) or billable events (SMSs sent, bandwidth required). Existing cost analyses for a variety of languages describe the resource consumption of programs by means of Cost Equation Systems (CESs), which are similar to, but more general than recurrence equations. CESs express the cost of a program in terms of the size of its input data. In a further step, a closed form (i.e., non-recursive) solution or upper bound can sometimes be found by using existing Computer Algebra Systems (CASs), such as Maple and Mathematica. In this work, we focus on cost analysis of Java bytecode, a language which is widely used in the context of mobile code and we study the problem of identifying variabl...

• Type: Journal
• Year: 2008
• Where: SAC
• Authors: Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini
• Keywords: Analysis, Applied Computing, Mobile Code, SAC 2008, Useless Variables