Heapviz: Interactive heap visualization for program understanding and debugging. (April 2013)

• Record Type: Journal Article
• Authors: Kelley, Sean; Aftandilian, Edward; Gramazio, Connor; Ricci, Nathan; Su, Sara L.; Guyer, Samuel Z.
• Other Names: Telea Alexandru C. guest-editor.; Görg Carsten guest-editor.; Reiss Steven guest-editor.
• Is Part Of: Information visualization. Volume 12:Number 2(2013)
• Page Start: 163
• Page End: 177
• Publication Date: 2013-04
• Subjects: Software visualization -- program visualization -- interactive graph visualization -- interactive visualization -- graph visualization -- force-directed layout; Information visualization -- Periodicals; 006.605
• DOI: 10.1177/1473871612438786
• Languages: English
• ISSNs: 1473-8716

Abstract

Understanding the data structures in a program is crucial to understanding how the program works, or why it does not work. Inspecting the code that implements the data structures, however, is an arduous task and often fails to yield insights into the global organization of a program's data. Inspecting the actual contents of the heap solves these problems but presents a significant challenge of its own: finding an effective way to present the enormous number of objects it contains. In this paper we present Heapviz, a tool for visualizing and exploring snapshots of the heap obtained from a running Java program. Unlike existing tools, such as traditional debuggers, Heapviz presents a global view of the program state as a graph, together with powerful interactive capabilities for navigating it. Our tool employs several key techniques that help manage the scale of the data. First, we reduce the size and complexity of the graph by using algorithms inspired by static shape analysis to aggregate the nodes that make up a data structure. Second, we implement a powerful visualization component whose interactive interface provides extensive support for exploring the graph. The user can search for objects based on type, connectivity, and field values; group objects; and color or hide and show each group. The user may also inspect individual objects to see their field values and neighbors in the graph. These interactive abilities help the user manage the complexity of these huge graphs. By applying Heapviz to both constructed and real-world examples, we show that it provides programmers with a powerful and intuitive tool for exploring program behavior.