Fast escape analysis and stack allocation for object-based programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1781, Issue , 2000, Pages 82-93

  Gay, David ^a   Steensgaard, Bjarne ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ESCAPE ANALYSIS; INTER-PROCEDURAL; ITERATOR; NON-TRIVIAL PROGRAMS; OBJECT BASED; RUNTIMES; STACK ALLOCATION; THREAD SYNCHRONIZATION;

PROGRAM COMPILERS;

EID: 84956969513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46423-9_6     Document Type: Conference Paper

References (28)

1. Jeffrey M. Barth. Shifting garbage collection overhead to compile time. Communications of the ACM, 20(7):513-518, July 1977.
2. Jeff Bogda and Urs Hölzle. Removing Unnecessary Synchronization in Java. In Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications (OOPSLA’ 99), pages 35-46.A CM Press, October 1999.
3. Bruno Blanchet. Escape Analysis for Object-Oriented Languages: Application to Java. In Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications (OOPSLA’ 99), pages 20-34. ACM Press, October 1999.
4. Bruno Blanchet. Escape analysis: Correctness proof, implementation and experimental results. In Conference Record of POPL’98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 25-37, San Diego, California, January 98.
5. E. Barendsen and S. Smetsers. Conventional and uniqueness typing in graph rewrite systems. In Rudrapatna K. Shyamasundar, editor, Proceedings of Foundations of Software Technology and Theoretical Computer Science, volume 761 of LNCS, pages 41-51, Bombay, India, December 1993. Springer-Verlag.
6. David F. Bacon and Peter F.S weeney. Fast static analysis of C++ virtual function calls. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, volume 31, 10 of ACM SIGPLAN Notices, pages 324-341, New York, October6-10 1996.A CM Press.
7. Ron Cytron, Jeanne Ferrante, Barry K.R osen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, October 1991.
8. Jong-Deok Choi, M. Gupta, Mauricio Serrano, Vugranam C Shreedhar, and Sam Midkiff. Escape Analysis for Java. In Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications (OOPSLA’99), pages 1-19.A CM Press, October 1999.
9. David R. Chase, Mark Wegman, and F. Kenneth Zadeck. Analysis of pointers and structures. ACM SIGPLAN Notices, 25(6):296-310, June 1990.
10. Julian Dolby and Andrew A. Chien. An Evaluation of Automatic Object Inline Allocation Techniques. In Proceedings of the 1998 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications (OOPSLA’98), pages 1-20.A CM Press, October 1998.
11. Alan Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In ACM-SIGPLAN ACM-SIGACT, editor, Conference Record of the 17th Annual ACM Symposium on Principles of Programming Languages (POPL’90), pages 157-168, San Francisco, CA, USA, January 1990.A CM Press.
12. Alain Deutsch. On the complexity of escape analysis. In Conference Record of POPL’97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 358-371, Paris, France, January 97.
13. Robert Fitzgerald, Todd B. Knoblock, Erik Ruf, Bjarne Steensgaard, and David Tarditi. Marmot: An optimizing compiler for Java. Technical Report MSR-TR-99-33, Microsoft Research, June 1999. Accepted for publication in Software — Practice & Experience.
14. James Hicks. Experiences with compiler-directed storage reclamation. In R. John M. Hughes, editor, Record of the 1993 Conference on Functional Programming and Computer Architecture, volume 523 of Lecture Notes in Computer Science, Copenhagen, June 1993.Springer-Verlag.
15. Simon Hughes. Com pile-time garbage collection for higher-order functional languages. Journal of Logic and Computation, 2(4):483-509, August 1992.
16. Katsuro Inoue, Hiroyuki Seki, and Hikaru Yagi. Analysis of functional programs to detect run-time garbage cells. ACM Transactions on Programming Languages and Systems, 10(4):555-578, October 1988.
17. S.B. Jones and D. Le Métayer. Compile-time garbage collection by sharing analysis. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture’89, Imperial College, London, pages 54-74, New York, NY, 1989.A CM.
18. Neil D.J ones and Steven S. Muchnick. Flow analysis and optimization of Lisp-like structures. In Steven S. Muchnick and Neil D.J ones, editors, Program Flow Analysis: Theory and Applications, pages 102-131.Englewood Cliffs, N.J.: Prentice-Hall, 1981.
19. Thomas P. Jensen and Torben Mogensen. A backwards analysis for compile-time garbage collection. In Neil D. Jones, editor, ESOP’90 3rd European Symposium on Programming, Copenhagen, Denmark, May 1990. (Lecture Notes in Computer Science, vol. 432), pages 227-239.Springer-Verlag, 1990.
20. Tim Lindholm and Frank Yellin. The Java Virtual Machine Specification. Addison-Wesley, second edition edition, 1999.
21. Markus Mohnen. Efficient compile-time garbage collection for arbitrary data structures. Technical Report 95-08, RWTH Aachen, Department of Computer Science, 1995.
22. Young Gil Park and Benjamin Goldberg. Escape analysis on lists. In Proceedings of the ACM SIGPLAN’92 Conference on Programming Language Design and Implementation (PLDI), pages 116-127, 1992.
23. Jakob Rehof and Torben Æ. Mogensen. Tractable constraints in finite semilattices. Science of Computer Programming, 35(2-3):191-221, 1998.
24. J.T.S chwartz. Optimization of very high level languages - I. Value transmission and its corollaries. Computer Languages, 1(2):161-194, 1975.
25. Manuel Serrano and Marc Feeley. Storage use analysis and its applications. In Proceedings of the 1st International Conference on Functional Programming, June 1996.
26. Bjarne Steensgaard. Points-to analysis in almost linear time. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 32-41, St. Petersburg, Florida, January 1996.
27. Jan Vitek, R. Nigel Horspool, and James Uhl. Compile-time analysis of object-oriented programs. In Proceedings of the 4th Int. Conf on Compiler Construction, CC’92, Paderborn, Germany, 1992.Springer-Verlag.
28. John Whaley and Martin Rinard. Com positional Pointer and Escape Analysis for Java Programs. In Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications (OOPSLA’99), pages 7-206.A CM Press, October 1999.