An empirical study of Java bytecode programs |
| |
Authors: | Christian Collberg Ginger Myles Michael Stepp |
| |
Affiliation: | 1. Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A.;2. Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A.Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. |
| |
Abstract: | We present a study of the static structure of real Java bytecode programs. A total of 1132 Java jar‐files were collected from the Internet and analyzed. In addition to simple counts (number of methods per class, number of bytecode instructions per method, etc.), structural metrics such as the complexity of control‐flow and inheritance graphs were computed. We believe this study will be valuable in the design of future programming languages and virtual machine instruction sets, as well as in the efficient implementation of compilers and other language processors. Copyright © 2006 John Wiley & Sons, Ltd. |
| |
Keywords: | Java bytecode measure software complexity metrics |
|
|