Optimizing Java: Theory and practice

Concurrency Practice and Experience

Volumn 9, Issue 6, 1997, Pages 445-463

  Budimlic, Zoran ^a   Kennedy, Ken ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OBJECT ORIENTED PROGRAMMING; OPTIMIZATION; PROGRAM COMPILERS; WIDE AREA NETWORKS;

INTERNET; JAVA PROGRAMMING LANGUAGE; JUST IN TIME (JIT) COMPILATION TECHNOLOGY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0031169036     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(199706)9:6<445::AID-CPE301>3.0.CO;2-L     Document Type: Article

References (20)

1. V. A. Aho, R. Sethi and J. D. Ullman, Compilers Principles, Techniques, and Tools, AddisonWesley. Reading, MA, 1986.
2. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman and F. K. Zadeck, 'Efficiently computing static single assignment form and the control dependence graph', ACM Trans. Program. Lang. Syst., 13(4), 451-490, (1991).
3. P. Briggs, T. Harvey and T. Simpson, 'Static single assignment construction', Technical Report, Rice University, July 1995. Available via anonymous ftp.
4. K. Kennedy, 'A survey of data flow analysis techniques', in Steven S. Muchnick and Neil D. Jones Ed., Program Flow Analysis: Theory and Applications, Prentice-Hall, 1981.
5. P. Briggs, R. Shillingsburg and T. Simpson 'Dead code elimination', Technical Report, Rice University, October 1993. Available via anonymous ftp.
6. M. N. Wegman and F. K. Zadeck, 'Constant propagation with conditional branches', Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, January 1985, pp. 291-299.
7. L. T. Simpson, L. T., 'Value Numbering', Technical Report, Rice University, September 1996. Available via anonymous ftp.
8. P. Briggs, K. D. Cooper and L. T. Simpson, 'Value numbering', Softw. - Prac. Exp., 26 (1996).
9. J. Bruno and T. Lassagne, 'The generation of optimal code for stack machines', J. ACM, 23(3), 382-396 (1975).
10. T. Lindholm and F. Yellin, The Java™ Virtual Machine Specification, Addison-Wesley, Reading, MA, 1996.
11. K. Cooper, K. Kennedy and L. Torczon, 'The impact of interprocedural analysis and optimization in the Rn programming environment', ACM Trans. Program. Lang. Syst. 8, 491-523 (1986).
12. C. Koelbel, D. Loveman, R. Schreiber, G. Steele, and M. Zosel, The High Performance Fortran Handbook, MIT Press, Cambridge, MA, 1993.
13. J. Gosling, B. Joy and G. Steele, 1996. The Java™ Language Specification, Addison-Wesley, Reading, MA, 1996.
14. C. Flanagan and M. Felleisen, 'Modular and polymorphic set-based analysis: theory and practice', Technical Report TR96-266, Rice University, 1996.
15. B. Steensgaard, 'Points-to analysis in almost linear time', Proceedings of the Twentythird Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, January 1996.
16. J. Hennessy, 'Symbolic debugging of optimized code', ACM Trans. Program. Lang. Syst., 4(3), 323-344 (1982).
17. J. E. Archer Jr, R. W. Conway, F. B. Schneider, 'User recovery and reversal in interactive systems', Technical Report TR81-476, Cornell University, Computer Science Department, 1981.
18. J. Long, 'Checkpoint-based forward recovery using lookahead execution and rollback validation in parallel and distributed systems', NASA contractor report, NASA CR-195760, 1994.
19. N. J. Alewine, 'Compiler-assisted multiple instruction rollback recovery using a read buffer', NASA contractor report, NASA CR-199703, 1995.
20. J M. Barth, 'Shifting garbage collection overhead to compile time', Communications of the ACM, 20(7), 513-518 (1997).