Visualizing memory graphs (2001) [21 citations — 0 self]
Download:
by Thomas Zimmermann, Andreas Zeller, Universität Passau, Universität Des Saarl, Fr Informatik
In Revised Lectures on Software Visualization, International Seminar
http://www.st.cs.uni-sb.de/papers/sv2001/sv2001.pdf
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Zimmermann01visualizingmemory,author = {Thomas Zimmermann and Andreas Zeller and Universität Passau and Universität Des Saarl and Fr Informatik},
title = {Visualizing memory graphs},
booktitle = {In Revised Lectures on Software Visualization, International Seminar},
year = {2001},
pages = {191--204},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Abstract:
Abstract. 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.
Citations
| 150 | An open graph visualization system and its applications to software engineering – Gansner, North - 1999 |
| 83 | Algorithm 457. Finding all cliques of an undirected graph – Bron, Kerbosch - 1973 |
| 47 | Subgraph isomorphism, matching relational structures and maximal cliques – Barrow, Burstall - 1976 |
| 31 | Shape analysis – Wilhelm, Sagiv, et al. - 2000 |
| 30 | Drawing large graphs with H3Viewer and Site Manager – Munzner - 1998 |
| 22 | DDD - A Free Graphical Front-End for UNIX Debuggers – Zeller, Lütkehaus - 1996 |
