Visualizing Memory Graphs – Software Visualization 2001

by Thomas Zimmermann, Andreas Zeller

To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture and explore program states. A memory graph gives a comprehensive view of all data structures of a program; data items are related by operations like dereferencing, indexing or member access. Although memory graphs are typically too large to be visualized as a whole, one can easily focus on specific aspects using well-known graph operations. For instance, a greatest common subgraph visualizes commonalities and differences between program states.

Download as PDF.
See also: http://www.st.cs.uni-sb.de/memgraphs/

Reference

Thomas Zimmermann, Andreas Zeller. Visualizing Memory Graphs. In Software Visualization, International Seminar Dagstuhl Castle, Germany, May 20-25, 2001, Revised Lectures (Software Visualization 2001), Dagstuhl, Germany, May 2001, pp. 191-204.

BibTeX Entry

@inproceedings{zimmermann-memgraphs-2001,
    title = "Visualizing Memory Graphs",
    author = "Thomas Zimmermann and Andreas Zeller",
    year = "2001",
    month = "May",
    booktitle = "Software Visualization, International Seminar Dagstuhl Castle, Germany, May 20-25, 2001, Revised
Lectures",
    editors = "Stephan Diehl",
    location = "Dagstuhl, Germany",
    pages = "191--204",
    publisher = "Springer",
    series = "Lecture Notes in Computer Science",
    volume = "2269",
    ISBN = "3540433236",
}