An empirical study of Java bytecode programs

Software - Practice and Experience

Volumn 37, Issue 6, 2007, Pages 581-641

  Collberg, Christian ^a   Myles, Ginger ^a   Stepp, Michael ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FILE ORGANIZATION; INTERNET; PROGRAM PROCESSORS; VIRTUAL STORAGE;

BYTECODE INSTRUCTIONS; INHERITANCE GRAPHS; INSTRUCTION SETS; JAR FILES; VIRTUAL MACHINE;

JAVA PROGRAMMING LANGUAGE;

EID: 34248581742     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.776     Document Type: Article

References (21)

1. Knuth DE. An empirical study of FORTRAN programs. Software - Practice and Experience 1971; 1:105-133.
2. Chevance RJ, Heidet T. Static profile and dynamic behavior of COBOL programs. SIGPLAN Notices 1978; 13(4):44-57.
3. Salvadori A, Gordon J, Capstick C. Static profile of COBOL programs. SIGPLAN Notices 1975; 10(8):20-33.
4. Cook RP, Lee I. A contextual analysis of Pascal programs. Software-Practice and Experience 1982; 12:195-203.
5. Saal HJ, Weiss Z. Some properties of APL programs. Proceedings of 7th International Conference on APL. ACM Press: New York, 1975; 292-297.
6. Saal HJ, Weiss Z. An empirical study of APL programs. International Journal of Computer Languages 1977; 2(3):47-59.
7. Stata R, Abadi M. A type system for Java bytecode subroutines. Conference Record of POPL 98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, CA, 1998. ACM Press: New York, 1998; 149-160.
8. Collberg CS, Tomborson C. Watermarking, tamper-proofing, and obfuscation - tools for software protection. IEEE Transactions on Software Engineering 2002; 8(8):735-746.
9. Collberg C, Myles M, Huntwork A. SANDMARK - A tool for software protection research. IEEE Magazine of Security and Privacy 2003; 1(4):40-49.
10. Lindholm T, Yellin F. The Java Virtual Machine Specification (2nd edn). Addison-Wesley: Reading, MA, 1999.
11. Cousot P, Cousot R. An abstract interpretation-based framework for software watermarking. Proceedings of the ACM Conference on Principles of Programming Languages. ACM Press: New York, 2004.
12. Dean J, Grove D, Chambers C. Optimization of object-oriented programs using static class hierarchy analysis. Proceedings of the 9th European Conference on Object-Oriented Programming. Springer: Berlin, 1995; 77-101.
13. Bernstein R. Producing good code for the case statement. Software-Practice and Experience 1985; 15(10):1021-1024.
14. Kannan S, Proebsting TA. Correction to 'producing good code for the case statement'. Software-Practice and Experience 1994; 24(2):233.
15. Collberg C, Kobourov S, Nagra J, Pitts J, Wampler K. A system for graph-based visualization of the evolution of software. Proceedings of the ACM Symposium on Software Visualization, June 2003. ACM Press: New York, 2003.
16. Cook RP. An empirical analysis of the Lilith instruction set. IEEE Transactions on Computers 1989; 38(1):156-158.
17. Antonioli DN, Pilz M. Analysis of the Java class file format. Technical Report, University of Zurich, 1998. Available at: ftp://ftp.ifi.unizh.ch/pub/techreports/TR-98/ifi-98.04.ps.gz.
18. Gustedt J, Mæhle OA, Telle JA. The treewidth of Java programs. Proceedings of the 4th International Workshop on Algorithm Engineering and Experiments (ALENEX) (Lecture Notes in Computer Science, vol. 2409). Springer: Berlin, 2002.
19. O'Donoghue D, Leddy A, Power J, Waldron J. Bigram analysis of Java bytecode sequences. Proceedings of the 2nd Workshop on Intermediate Representation Engineering for the Java Virtual Machine. National University of Ireland: Ireland, 2002; 187-192.
20. Appel A. Sample graph coloring problems, http://www.cs.princeton.edu/ ~appel/graphdata/.
21. SpecJVM98. http://www.specbench.org/osg/jvm98.