Browse > Article

Escape Analysis for Stack Allocation in Java  

조은선 (충북대학교 전기전자컴퓨터학부)
Publication Information
Journal of KIISE:Software and Applications / v.31, no.6, 2004 , pp. 840-848 More about this Journal
Abstract
Garbage collecting objects in Java makes memory management easier for the programmer, but it is time consuming. Stack allocation may be an alternative which identifies stack-allocatable objects before the execution, without performance degradation. We suggest an escaping analysis recording the interprocedural movement of the method, to detect an object the method of whose creation may have been already deactivated during the access. Our approach is different from prior works, enables us to handle some cases that are missed in the previous variable - oriented approach.
Keywords
static analysis; stack allocation; interpretation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Blanchet. 'Escape analysis for object oriented languages application to java,' In Proc. of the ACM OOPSLA Conf., 1999   DOI
2 J-D. Choi et. al, 'Escape Analysis for Java,' In Proc. of the ACM OOPSLA Conf., 1999   DOI
3 J. Whaley and M. Rinard. 'Compositional Pointer and Escape Analysis for Java Programs,' In Proc. of the ACM OOPSLA Conf., 1999   DOI
4 P. Cousot and R. Cousot. 'Abstract interpretation frameworks,' Journal of Logic and Computation, 2(4), 1992   DOI
5 P. Cousot and R. Cousot. 'Abstract interpretation : a unified lattice model for static analysis of programs by construction of approximation,' In Proc. of SIGPLAN Conf. on Principle of Programming Languages, 1977   DOI
6 W. L. Harrison, 'The Interprocedural Analysis and Automatic Parallelization of scheme Programs,' Lisp and Symbolic Computation, 2(3):179-396, 1989   DOI
7 T. Lindholm and F. Yelline, 'The JavaTM Virtual Machine Specification-2nd edition,' Addison-Wesley, 1999
8 A. Deutsch, 'On Determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications,' In Proc. of the ACM symposium on principles of Programming Languages (POPL), 1990   DOI
9 A. Deutsch, 'On the Complexity of Escape Analysis,' In Proc. of the ACM symposium on principles of Programming Languages(POPL), 1997   DOI
10 B. Blanchet, 'Escape Analysis: Correctness Proof, Implementation and Experimental Results,' In Proc. of the ACM symposium on principles of Programming Languages (POPL), 1998   DOI
11 E.-S. Cho, K. Yi, 'Escape Analysis for Stack Allocation in Java,' ECOOP workshop on Formal Techniques for Java Programs, 2000
12 P. Cousot and R. Cousot, 'Modular Static Program Analysis,' in Proc. of the Eleventh International Conference on Compiler Construction (CC 2002), 2002