Escape analysis for Java™: Theory and practice

ACM Transactions on Programming Languages and Systems

Volumn 25, Issue 6, 2003, Pages 713-775

  Blanchet, Bruno ^a,b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Java; Optimization; Stack allocation; Static analysis; Synchronization elimination

Indexed keywords

JAVA; STACK ALLOCATION; STATIC ANALYSIS; SYNCHRONIZATION ELIMINATION;

BENCHMARKING; COMPUTER AIDED DESIGN; DATA REDUCTION; INTEGER PROGRAMMING; OPTIMIZATION; SYNCHRONIZATION;

JAVA PROGRAMMING LANGUAGE;

EID: 23444455434     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/945885.945886     Document Type: Article

References (44)

1. AGESEN, O., DETLEFS, D., GARTHWAITE, A., KNIPPEL, R., RAMAKRISHNA, Y. S., AND WHITE, D. 1999. An efficient meta-lock for implementing ubiquitous synchronization. In Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'99, Denver, CO). ACM Press, New York, 207-222.
2. AIKEN, A., FÄHNDRICH, M., AND LEVIEN, R. 1995. Better static memory management: Improving region-based analysis of higher-order languages. In SIGPLAN Conference on Programming Language Design and Implementation (PLDI'95, La Jolla, CA). ACM Press, New York, NY, 174-185.
3. ALDRICH, J., CHAMBERS, C., SIRER, E. G., AND EGGERS, S. 1999. Static analyses for eliminating unnecessary synchronization from Java programs. In Static Analysis Symposium (SAS'99, Venice, Italy). Lecture Notes on Computer Science, vol. 1694. Springer Verlag, Berlin, Germany, 19-38.
4. BACON, D. F. 1997. Fast and efficient optimization of statically typed object-oriented languages. Ph.D. thesis. University of California, Berkeley, Berkeley, CA.
5. BACON, D. F., KONURU, R., MURTHY, C., AND SERRANO, M. 1998. Thin locks: Featherweight synchronization for Java. In Proceedings of the ACM SIGPLAN'98 Conference on Programming Language Design and Implementation (PLDI'98, Montreal, Canada). ACM Press, New York, NY, 258-268.
6. BIRKEDAL, L., TOFTE, M., AND VEJLSTRUP, M. 1996. From region inference to von Neumann machines via region representation inference. In 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'96, St. Petersburg Beach, FL). ACM Press, New York, NY, 171-183.
7. BLANCHET, B. 1998. Escape analysis: Correctness proof, implementation and experimental results. In 25th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'98, San Diego, CA). ACM Press, New York, NY, 25-37.
8. BLANCHET, B. 1999. Escape analysis for object oriented languages. Application to Java™. In Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'99, Denver, CO). ACM Press, New York, NY, 20-34.
9. BLANCHET, B. 2000. Escape analysis. Applications to ML and Java™ Ph.D. thesis, École Polytechnique.
10. BOGDA, J. AND HÖLZLE, U. 1999. Removing unnecessary synchronization in Java. In Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'99, Denver, CO). ACM Press, New York, NY, 35-46.
11. CARR, S., MCKINLEY, K. S., AND TSENG, C.-W. 1994. Compiler optimizations for improving data locality. In 6th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'94). ACM Press, New York, NY, 252-262.
12. CHASE, D. R. 1988. Safety considerations for storage allocation optimizations. In Proceedings of the SIGPLAN'88 Conference on Programming Language Design and Implementation (PLDI'88, Atlanta, GA). ACM Press, New York, NY, 1-10.
13. CHOI, J.-D., GUPTA, M., SERRANO, M., SREEDHAR, V. C., AND MIDRIFF, S. 1999. Escape analysis for Java. In Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'99, Denver, CO). ACM Press, New York, NY, 1-19.
14. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th Annual ACM Symposium on Principles of Programming Languages (Los Angeles, CA.). ACM Press, New York, NY, 238-252.
15. COUSOT, P. AND COUSOT, R. 1979. Systematic design of program analysis frameworks. In Conference Record of the 6th Annual ACM Symposium on Principles of Programming Languages (San Antonio, TX). ACM Press, New York, NY, 269-282.
16. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1991. Efficiently computing static single assignment form and the control dependance graph. ACM Trans. Program. Lang. Syst. 13, 4 (Oct.), 451-490.
17. DEAN, J., GROVE, D., AND CHAMBERS, C. 1995. Optimization of object-oriented programs using static class hierarchy analysis. In Proceedings of the 9th European Conference on Object-Oriented Programming. Lecture Notes on Computer Science, vol. 952. Springer Verlag, Berlin, Germany, 77-101.
18. DEUTSCH, A. 1990. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In 17th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. (San Francisco, CA). ACM Press, New York, NY, 157-168.
19. DEUTSCH, A. 1994. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In Proceedings of the SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI'94, Orlando, FL). ACM Press, New York, NY, 230-241.
20. DEUTSCH, A. 1997. On the complexity of escape analysis. In 24th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Language's (POPL'97, Paris, France). ACM Press, New York, NY, 358-371.
21. DINIZ, P. C. AND RINARD, M. C. 1998. Lock coarsening: Eliminating lock overhead in automatically parallelized object-based programs. J. Parallel Distrib. Comput. 49, 2 (Mar.), 218-244.
22. FITZGERALD, R., KNOBLOCK, T. B., RUF, E., STEENSGAARD, B., AND TARDITI, D. 2000. Marmot: An optimizing compiler for Java. Softw. Pract. Exper. 30, 3 (Mar.), 199-232.
23. GAY, D. AND STEENSGAARD, B. 2000. Fast escape analysis and stack allocation for object-based programs. In Compiler Construction, 9th International Conference, CC'2000, D. A. Watt, Ed. Lecture Notes on Computer Science, vol. 1781. Springer Verlag, Berlin, Germany, 82-93.
24. HARRISON, W. 1989. The interprocedural analysis and automatic parallelisation of Scheme programs. J. Lisp Symb. Comput. 2, 176-396.
25. HEDERMAN, L. 1988. Compile time garbage collection using reference count analysis. Tech. rep. Rice COMP TR88-75, Rice University, Houston, TX.
26. HORWITZ, S., DEMERS, A., AND TEITELBAUM, T. 1987. An efficient general iterative algorithm for dataflow analysis. Acta Inf. 24, 6, 679-694.
27. HUDAK, P. 1986. A semantic model of reference counting and its abstraction (detailed summary). In Proceedings of the 1986 ACM Conference on LISP and Functional Programming (Cambridge, MA). ACM Press, New York, NY, 351-363.
28. HUGHES, S. 1992. Compile-time garbage collection for higher-order functional languages. J. Logic Comput. 2, 4, 483-509.
29. INOUE, K., SEKI, H., AND YAGI, H. 1988. Analysis of functional programs to detect run-time garbage cells. ACM Trans. Program. Lang. Syst. 10, 4 (Oct.), 555-578.
30. JONES, N. D. AND MUCHNICK, S. 1982. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In 9th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (Albuquerque, NM). ACM Press, New York, NY, 66-74.
31. MCDOWELL, C. E. 1998. Reducing garbage in Java. ACM Sigplan Not. 33, 9 (Sept.), 84-86.
32. MOHNEN, M. 1995a. Efficient closure utilisation by higher-order inheritance analysis. In Static Analysis Symposium (SAS'95). Lecture Notes on Computer Science, vol. 983. Springer Verlag, Berlin, Germany, 261-278.
33. MOHNEN, M. 1995b. Efficient compile-time garbage collection for arbitrary data structure. In Symposium on Programming Language Implementation and Logic Programming (PLILP'95). Lecture Notes on Computer Science, vol. 982. Springer Verlag, Berlin, Germany, 241-258.
34. MULLER, G., MOURA, B., BELLARD, F., AND CONSEL, C. 1997. Harissa: A flexible and efficient Java environment mixing bytecode and compiled code. In 3rd Usenix Conference on Object-Oriented Technologies and Systems (COOTS'97). Portland, OR, 1-20.
35. ONODERA, T. AND KAWACHIYA, K. 1999. A study of locking objects with bimodal fields. In Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'99, Denver, CO). ACM Press, New York, NY, 223-237.
36. PARK, Y. G. AND GOLDBERG, B. 1992. Escape analysis on lists. In Proceedings of the ACM SIGPLAN'92 Conference on Programming Language Design and Implementation (PLDI'92, San Francisco, CA). ACM Press, New York, NY, 116-127.
37. QIAN, Z. 1998. A formal specification of Java™ virtual machine instructions for objects, methods and subroutines. In Formal Syntax and Semantics of Java(tm), J. Alves-Foss, Ed. Lecture Notes on Computer Science, vol. 1523. Springer Verlag, Berlin, Germany.
38. RUF, E. 2000. Effective synchronization removal for Java. In ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI'00, Vancouver, Canada). ACM Press, New York, NY, 208-218.
39. RUGGIERI, C. AND MURTAGH, T. P. 1988. Lifetime analysis of dynamically allocated objects. In Proceedings of the 15th Annual ACM SIGACT-SIGPLAN Symposiumon Principles of Programming Languages (POPL'88, San Diego, CA). ACM Press, New York, NY, 285-293.
40. SERRANO, M. AND FEELEY, M. 1996. Storage use analysis and its applications. In 1996 ACM SIGPLAN International Conference on Functional Programming (ICFP, Philadelphia, PA). ACM Press, New York, NY, 50-61.
41. SHIVERS, O. 1988. Control flow analysis in Scheme. In Proceedings of the SIGPLAN'88 Conference on Programming Language Design and Implementation (PLDI'88, Atlanta, GA). ACM Press, New York, NY, 164-174.
42. TOFTE, M. AND TALPIN, J.-P. 1993. A theory of stack allocation in polymorphically typed languages. Tech. rep. 93/15, Departement of Computer Science, Copenhagen University, Copenhagen, Denmark.
43. WEISS, M. ET AL. 1998. TurboJ: A Java bytecode-to-native compiler. In Proceedings of Workshop on Languages, Compilers and Tools for Embedded Systems. Lecture Notes on Computer Science, vol. 1474. Springer Verlag, Berlin, Germany, 119-130.
44. WHALEY, J. AND RINARD, M. 1999. Compositional pointer and escape analysis for Java programs. In Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'99, Denver, CO). ACM Press, New York, NY, 187-206.