Establishing local temporal heap safety properties with applications to compile-time memory management

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

Volumn 2694, Issue , 2003, Pages 483-503

  Shaham, Ran ^a,b   Yahav, Eran ^a   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

COMPUTER SOFTWARE; STATIC ANALYSIS;

COMPILE TIME; JAVA PROGRAM; MEMORY MANAGEMENT; PROGRAM POINTS; SAFETY PROPERTY; SPACE CONSUMPTION; STATIC ALGORITHMS; VERIFICATION PROCESS;

JAVA PROGRAMMING LANGUAGE;

EID: 21144449292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44898-5_27     Document Type: Article

References (33)

1. O. Agesen, D. Detlefs, and E. Moss. Garbage Collection and Local Variable Type-Precision and Liveness in Java Virtual Machines. In Prog. Lang. Design and Impl., June 1998.
2. M. F. Alexander Aiken and R. Levien. Better static memory management: Improving region-based analysis of higher-order languages. In Prog. Lang. Design and Impl., June 1995.
3. A. W. Appel. Compiling with Continuations, chapter 16, pages 205-214. CUP, 1992.
4. T. Ball and S. Rajamani. SLIC: A Specification Language for Interface Checking (of C). Technical Report MSR-TR-2001-21, MSR, 2001.
5. J. M. Barth. Shifting garbage collection overhead to compile time. Commun. ACM, 20(7):513-518, 1977.
6. L. Birkedal, M. Tofte, and M. Vejlstrup. From region inference to von neumann machines via region representation inference. In Symp. on Princ. of Prog. Lang., pages 171-183, 1996.
7. tm. In Conf. on Object-Oriented Prog. Syst., Lang. and Appl., Denver, 1998.
8. T. Colcombet and P. Fradet. Enforcing trace properties by program transformation. In Proc. of 27th POPL, pages 54-66, Jan. 19-21, 2000.
9. J. Corbett, M. Dwyer, J. Hatcliff, C. Pasareanu, R. Shawn, and L. Hongjun. Bandera: Extracting finite-state models from Java source code. In Proc. 22nd ICSE, June 2000.
10. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Symp. on Princ. of Prog. Lang., New York, NY, 1979. ACM Press.
11. M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In Prog. Lang. Design and Impl., pages 57-68, Berlin, June 2002.
12. I. Foster and W. Winsborough. Copy avoidance through compile-time analysis and local reuse. In Proceedings of International Logic Programming Sympsium, pages 455-469, 1991.
13. N. Hallenberg, M. Elsman, and M. Tofte. Combining region inference and garbage collection. In Prog. Lang. Design and Impl., pages 141-152, Berlin, 2002.
14. G. W. Hamilton. Compile-time garbage collection for lazy functional languages. In Memory Management, International Workshop IWMM 95, 1995.
15. M. Hirzel, A. Diwan, and A. L. Hosking. On the usefulness of type and liveness accuracy for garbage collection and leak detection. In Trans. on Prog. Lang. and Syst., 2002.
16. S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis for pointer variables. In Prog. Lang. Design and Impl., pages 28-40, New York, NY, 1989. ACM Press.
17. K. Inoue, H. Seki, and H. Yagi. Analysis of functional programs to detect run-time garbage cells. Trans. on Prog. Lang. and Syst., 10(4):555-578, Oct. 1988.
18. Java card 2.2 development kit. Available at java.sun.com/products/javacard.
19. R. Jones. Garbage Collection. Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, 1999.
20. T. Lev-Ami, T. W. Reps, R. Wilhelm, and S. Sagiv. Putting static analysis to work for verification: A case study. In ISSTA, pages 26-38, 2000.
21. T. Lev-Ami and M. Sagiv. TVLA: A framework for kleene based static analysis. In Static Analysis Symposium. Springer, 2000.
22. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997.
23. Oberthur card systems, http://www.oberthurcs.com.
24. N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. Lecture Notes in Computer Science, 2027:133-149, 2001.
25. J. Ross and M. Sagiv. Building a bridge between pointer aliases and program dependences. In Proceedings of the 1998 European Symposium On Programming, Mar. 1998.
26. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 24(3):217-298, 2002.
27. F. Schneider. Enforceable security policies. ACM Transactions on Information and System Security, 3(1):30-50, Feb. 2000.
28. R. Shaham, E. K. Kolodner, and M. Sagiv. Automatic removal of array memory leaks in Java. In Int. Conf. on Comp. Construct. Springer, Apr. 2000.
29. R. Shaham, E. K. Kolodner, and M. Sagiv. Heap profiling for space-efficient java. In Prog. Lang. Design and Impl. ACM, June 2001.
30. R. Shaham, E. K. Kolodner, and M. Sagiv. Backward shape analysis to statically predict heap behavior. Unpublished manuscript, 2002.
31. R. Shaham, E. K. Kolodner, and M. Sagiv. Estimating the impact of heap liveness information on space consumption in java. In Int. Symp. on Memory Management. ACM, 2002.
32. M. Tofte and J.-P. Talpin. Implementation of the typed call-by-value lambda-calculus using a stack of regions. In Symp. on Princ. of Prog. Lang., pages 188-201, 1996.
33. R. Vallée-Rai, L. Hendren, V. Sundaresan, E. G. P. Lam, and P. Co. Soot - a java optimization framework. In Proceedings of CASCON 1999, pages 125-135, 1999.