A framework for optimizing Java using attributes

Proceedings of CASCON - 1st Decade High Impact Papers

Volumn , Issue , 2010, Pages 225-241

  Pominville, Patrice ^a   Qian, Feng ^a   Vallée Rai, Raja ^a   Hendren, Laurie ^a   Verbrugge, Clark ^b  

^a MCGILL UNIVERSITY   (Canada)

^b IBM TORONTO LAB   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLASS FILE; JAVA BYTE CODES; JAVA CLASS FILES; JAVA PROGRAM; JAVA VIRTUAL MACHINES; JUST IN TIME COMPILERS;

COMPUTER SOFTWARE; OPTIMIZATION; PROGRAM COMPILERS;

JAVA PROGRAMMING LANGUAGE;

EID: 79952154321     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1925805.1925819     Document Type: Conference Paper

References (26)

1. Ana Azevedo, Joe Hummel, and Alex Nicolau. Java annotation-aware just-in-time (AJIT) compilation system. In Proceedings of the ACM 1999 Conference on Java Grande, pages 142-151, Palo Alto, CA, June 1999.
2. R. Bodik, R. Gupta, and V. Sarkar. ABCD: Eliminating Array Bounds Checks on Demand. In Proceedings of the ACM SIGPLAN '00 Conference on Programming Language Design and Implementation(PLDI), pages 321-333, Vancouver, BC, Canada, June 2000. (Pubitemid 32394105)
3. M. Cierniak and W. Li. Optimizing Java byte-codes. Concurrency, Practice and Experience, 9(6):427-444, 1997.
4. Michal Cierniak, Guei-Yuan Lueh, and James M. Stichnoth. Practicing JUDO: Java under Dynamic Optimizations. In Proceedings of the ACM SIGPLAN '00 Conference on Programming Language Design and Implementation(PLDI), pages 13-26, Vancouver, BC, Canada, June 2000. (Pubitemid 32394079)
5. Geoff A. Cohen, Jeffrey S. Chase, and David L. Kaminsky. Automatic program transformation with JOIE. In Proceedings of the USENIX 1998 Annual, Technical, Conference, pages 167-178, Berkeley, USA, June 15-19 1998. USENIX Association.
6. Etienne M. Gagnon, Laurie J. Hendren, and Guillaume Marceau. Efficient inference of static types for Java bytecode. In Static Analysis Symposium 2000, Lecture Notes in Computer Science, Santa Barbara, June 2000.
7. David Gay and Bjarne Steensgaard. Fast escape analysis and stack allocation for object-based programs. In Proceedings of the International Conference on Compiler Construction (CC 2000), pages 82-93, 2000.
8. S. Ghemawat, K.H. Randall, and D.J. Scales. Field Analysis: Getting Useful and Low-Cost Interprocedural Information. In Proceedings of the ACM SIGPLAN '00 Conference on Programming Language Design and Implementation(PLDI), pages 334-344, Vancouver, BC, Canada, June 2000. (Pubitemid 32394106)
9. R. Gupta. Optimizing array bound checks using flow analysis. A CM Letters on Programming Languages and Systems, 2(1-4):135-150, 1993.
10. W. Harrison. Compiler analysis of the value ranges of variables. IEEE Transactions on Software Engineering, 3(3):243-250, 1977.
11. Joseph Hummel, Ana Azevedo, David Kolson, and Alexandru Nicolau. Annotating the Java bytecodes in support of optimization. Concurrency: Practice and Experience, 9(11):1003-1016, November 1997. Special Issue: Java for computational science and engineering - simulation and modeling II. (Pubitemid 127679648)
12. The Jasmin Bytecode Assembler. http://mrl.nyu.edu/meyer/jvm/jasmin.html.
13. JavaClass www.inf.fu-berlin.de/~dahm/JavaClass/.
14. Joel Jones and Samuel Kamin. Annotating Java bytecodes in support of optimization. Concurrency: Practice and Experience, (to appear).
15. Compaq-JTrek. http://www.digital.com/java/download/jtrek.
16. Priyadarshan Kolte and Michael Wolfe. Elimination of redundant array subscript range checks. ACM SIGPLAN Notices, 30(6):270-278, 1995.
17. Han Bok Lee and Benjamin G. Zorn. A tool for instrumenting Java bytecodes. In The USENIX Symposium on Internet Technologies and Systems, pages 73-82, 1997.
18. Tim Lindholm and Frank Yellin. The Java Virtual Machine Specification. Addison-Wesley, Reading, MA, USA, second edition, 1999.
19. S. Midkiff, J. Moreira, and M. Snir. Optimizing bounds checking in Java programs. IBM Systems Journal, 37(3):409-453, August 1998.
20. J.E. Moreira, S.P. Midkiff, and M. Gupta. A Standard Java Array Package for Technical Computing. In Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, TX, March 1999.
21. Soot - a Java Optimization Framework. http://www.sable.mcgill.ca/soot/.
22. T. Suganuma, T. Ogasawara, M. Takeuchi, T. Yasue, M. Kawahito, K. Ishizaki, H. Komatsu, and T. Nakatani. Overview of the IBM Java Just-in-Time Compiler. IBM Systems Journal, 39(1):175-193, 2000. (Pubitemid 30588179)
23. Vijay Sundaresan, Laurie Hendren, Chrislain Razafimahefa, Raja Vallée-Rai, Patrick Lam, and Étienne Gagnon. Practical virtual method call resolution for Java. In Proceedings OOPSLA 2000 Conference on Object-Oriented Programming Systems, Languages, and Applications, ACM SIGPLAN Notices. ACM, October 2000.
24. Frank Tip, Chris Laffra, Peter F. Sweeney, and David Streeter. Practical experience with an application extractor for Java. In Proceedings OOPSLA '99 Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 292-305, October 1999. (Pubitemid 32213990)
25. Raja Vallee-Rai, Phong Co, Etienne Gagnon, Laurie Hendren, Patrick Lam, and Vijay Sundaresan. Soot - a Java Bytecode Optimization Framework. In Proceedings of CASCON '99, pages 125-135, 1999.
26. Raja Vallée-Rai, Etienne Gagnon, Laurie Hendren, Patrick Lam, Patrice Pominville, and Vijay Sundaresan. Optimizing Java bytecode using the Soot framework: Is it feasible? In David A. Watt, editor, Compiler Construction, 9th International Conference, volume 1781 of Lecture Notes in Computer Science, pages 18-34, Berlin, Germany, March 2000. Springer.