Automatic removal of array memory leaks in java

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

Volumn 1781, Issue , 2000, Pages 50-66

  Shaham, Ran ^a,b   Kolodner, Elliot K ^b   Sagiv, Mooly ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS;

AUTOMATIC REMOVAL; GARBAGE COLLECTION; GARBAGE COLLECTORS; JAVA APPLICATIONS; JAVA VIRTUAL MACHINES; MEASUREMENTS OF; MEMORY LEAKS; OUT-OF-MEMORY;

JAVA PROGRAMMING LANGUAGE;

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

References (17)

1. Ole Agesen, David Detlefs, and Elliot Moss. Garbage Collection and Local Variable Type-Precision and Liveness in Java Virtual Machines. In SIGPLAN Conf on Prog. Lang. Design and Impl., June 1998.
2. David F. Bacon, Ravi Konuru, Chet Murthy, and Mauricio Serrano. Thin Locks: Featherweight Synchronization for Java. In SIGPLAN Conf on Prog. Lang. Design and Impl., June 1998.
3. Gilad Bracha, Martin Odersky, David Stoutamire, and Philip Wadler. Making the future safe for the past: Adding genericity to the java programming language. In Conf. on Object-Oriented Prog. Syst., Lang and Appl., Vancouver, B.C., 1998.
4. Cormen, Leiserson, and Rivest. Algorithms. MIT Press and McGraw-Hill, 1994.
5. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Symp on Princ of Prog. Lang., pages 269-282, New York, NY, 1979. ACM Press.
6. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Symp on Princ of Prog. Lang., January 1978.
7. Amer Diwan, Eliot Moss, and Richard Hudson. Compiler support for garbage collection in a statically typed language. In SIGPLAN Conf on Prog. Lang. Design and Impl., pages 273-282, San Francisco, CA, June 1992.
8. Rajiv Gupta. Optimizing array bound checks using flow analysis. Let on Prog. Lang. and Syst., 2(1-4):135-150, March-December 1993.
9. Priyadarshan Kolte and Michael Wolfe. Elimination of redundant array subscript range checks. In SIGPLAN Conf on Prog. Lang. Design and Impl., 1995.
10. Barbara Liskov et al. CLU reference manual. In Lec. Notes in Comp. Sci., volume 114. Springer-Verlag, Berlin, 1981.
11. William Pugh. The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis. In Communications of the ACM, August 1992.
12. T. Reps, S. Horwitz, and M. Sagiv. Precise inter procedural dataflow analysis via graph reachability. In Symp on Princ of Prog. Lang., New York, NY, 1995.
13. Ran Shaham. Automatic removal of array memory leaks in Java. Master’s thesis, Tel-Aviv University, Tel-Aviv, Israel, September 1999. Available at “http://www.math.tau.ac.il/∼rans/thesis.zip”.
14. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 9-234. Prentice-Hall, Englewood Cliffs, NJ, 1981.
15. SPEC JVM98. Standard Performance Evaluation Corporation (SPEC), Fairfax, VA, 1998. Available at http://www.spec.org/osg/jvm98/.
16. Paul R. Wilson. Uniprocessor garbage collection techniques. In Memory Management, International Workshop IWMM, September 1992.
17. Michael Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, 1995.