An empirical study of Java bytecode programs
Authors:
- 24 October 2006
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 37 (6) , 581-641
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
This publication has 13 references indexed in Scilit:
- Sandmark-A tool for software protection researchIEEE Security & Privacy, 2003
- Watermarking, tamper-proofing, and obfuscation - tools for software protectionIEEE Transactions on Software Engineering, 2002
- Correction to ‘producing good code for the case statement’Software: Practice and Experience, 1994
- An empirical analysis of the Lilith instruction setIEEE Transactions on Computers, 1989
- Producing good code for the case statementSoftware: Practice and Experience, 1985
- A contextual analysis of Pascal programsSoftware: Practice and Experience, 1982
- Static profile and dynamic behavior of COBOL programsACM SIGPLAN Notices, 1978
- An empirical study of APL programsComputer Languages, 1977
- Static profile of COBOL programsACM SIGPLAN Notices, 1975
- An empirical study of FORTRAN programsSoftware: Practice and Experience, 1971