Dynamic Data Structure Analysis for Java Programs

摘要: Analysis of dynamic data structure usage is useful for both program understanding and improving the accuracy other analyses. Static analysis techniques, however, suffer from reduced in complex situations, do not necessarily give a clear picture runtime heap activity. We have designed implemented system that allows one to examine analyze how Java programs build modify structures. Using complete execution trace profiled run program, we an internal representation mirrors evolving The resulting series representations can then be analyzed visualized, show use our approach help understand structures, precise effect garbage collection, establish limits on static analysis. A deep structures particularly important modern, object-oriented languages make extensive heap-based