Dynamic data structure analysis for Java programs

IEEE International Conference on Program Comprehension

Volumn 2006, Issue , 2006, Pages 191-201

  Sokhom, Pheng ^a   Verbrugge, Clark ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC DATA STRUCTURE ANALYSIS; EXECUTION TRACE; RUNTIME HEAP ACTIVITY; STATIC DATA STRUCTURE ANALYSIS;

DATA REDUCTION; DATA STRUCTURES; OBJECT ORIENTED PROGRAMMING; PROGRAMMING THEORY; SUPERVISORY AND EXECUTIVE PROGRAMS;

JAVA PROGRAMMING LANGUAGE;

EID: 33845440827     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPC.2006.20     Document Type: Conference Paper

References (26)

1. J. Bogda and A. Singh. Can a shape analysis work at runtime? In Proceedings of the 1st Java Virtual Machine Research and Technology Symposium. USENIX, 2001.
2. R. Brown, K. Driesen, D. Eng, L. Hendren, J. Jorgensen, C. Verbrugge, and Q. Wang. STEP: A framework for the efficient encoding of general trace data. In Proceedings of the 2002 ACM SIGPLAN-SIGSOFT Workshop on Program Anaylsis for Software Tools and Engineering (PASTE), New York, New York, United States, Nov. 2002. ACM Press.
3. B. Cahoon and K. S. McKinley. Data flow analysis for software prefetching linked data structures in Java controller. In PACT01, pages 280-291, Barcelona, Spain, Sept. 2001.
4. F. Corbera, R. Asenjo, and E. Zapata. New shape analysis and interprocedural techniques for automatic parallelization of C codes. Int. J. Parallel Program., 30(1):37-63, 2002.
5. B. Dufour. Objective quantification of program behaviour using dynamic metrics. Master's thesis, McGill University, Montréal, Québec, Canada, 2004.
6. B. Dufour, K. Driesen, L. Hendren, and C. Verbrugge. Dynamic metrics for Java. In Proceedings of the ACM SIGPLAN 2003 Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA '03), pages 149-168, 2003.
7. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. In International Conference on Software Engineering, pages 213-224, 1999.
8. P. Fradet and D. L. Métayer. Shape types. In POPL '97: Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 27-39, New York, NY, USA, 1997.
9. R. Ghiya and L. J. Hendren. Is it a tree, a dag, or a cyclic graph? a shape analysis for heap-directed pointers in C. In POPL '96: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 1-15, New York, NY, USA, 1996.
10. B. Hackett and R. Rugina. Region-based shape analysis with tracked locations. In POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 310-323, New York, NY, USA, 2005.
11. L. J. Hendren and A. Nicolau. Parallelizing programs with recursive data structures. In IEEE Transaction on Parallel and Distributed Systems, Vol. 1, No. 1, pages 35-47, January 1990.
12. J. Hummel, L. J. Hendren, and A. Nicolau. Abstract description of pointer data structures: an approach for improving the analysis and optimization of imperative programs. ACM Lett. Program. Lang. Syst., 1(3):243-260, 1992.
13. D. Johannes, R. Seidel, and R. Wilhelm. Algorithm animation using shape analysis: visualising abstract executions. In SoftVis '05: Proceedings of the 2005 ACM symposium on Software visualization, pages 17-26, New York, NY, USA, 2005.
14. N. Klarlund and M. I. Schwartzbach. Graph types. In POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 196-205, New York, NY, USA, 1993.
15. T. Lev-Ami and M. Sagiv. TVLA: a system for implementing static analyses. In J. Palsberg, editor, Proceedings of the 7th International Static Analysis Symposium (SAS'00), number 1824 in LNCS, pages 280-302, 2000.
16. T. Lindholm and F. Yellin. The Java™ Virtual Machine Specification. Addison Wesley, 1996.
17. A. Navarro, F. Corbera, R. Asenjo, A. Tineo, O. Plata, and E. Zapata. A new dependence test based on shape analysis for pointer-based codes. In LCPC '04: Proceedings of the 17th International Workshop on Languages and Compilers for Parallel Computing, 2004.
18. J. W. Nimmer and M. D. Ernst. Static verification of dynamically detected program invariants: Integrating Daikon and ESC/Java. In Proceedings of RV'01, First Workshop on Runtime Verification, Paris, France, July-23 2001.
19. T. Printezis and R. Jones. GCspy: an adaptable heap visualisation framework. In OOPSLA '02: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, pages 343-358, New York, NY, USA, 2002.
20. E. Raman and D. I. August. Recursive data structure profiling. In Memory Systems Performance Workshop (MSP'05), Chicago, Illinois, June 2005.
21. S. P. Reiss and M. Renieris. Jove: Java as it happens. In SoftVis '05: Proceedings of the 2005 ACM symposium on Software visualization, pages 115-124, New York, NY, USA, 2005.
22. N. Röjemo and C. Runciman. Lag, drag, void and use - heap profiling and space-efficient compilation revisited. In ICFP '96: Proceedings of the first ACM SIGPLAN international conference on Functional programming, pages 34-41, New York, NY, USA, 1996.
23. R. Shaham, E. K. Kolodner, and M. Sagiv. On the effectiveness of GC in Java. In ISMM '00: Proceedings of the 2nd international symposium on Memory management, pages 12-17, New York, NY, USA, 2000.
24. SPEC Corporation. The SPEC JVM Client98 benchmark suite. http://www.spec.org/jvm98/jvm98/, 1998.
25. R. Wilhelm, S. Sagiv, and T. W. Reps. Shape analysis. In Computational Complexity, pages 1-17, 2000.
26. T. Zimmermann and A. Zeller. Visualizing memory graphs. In Software Visualization, pages 191-204, 2001.