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.
CITATION STYLE
Zimmermann, T., & Zeller, A. (2002). Visualizing memory graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2269, pp. 191–204). Springer Verlag. https://doi.org/10.1007/3-540-45875-1_15
Mendeley helps you to discover research relevant for your work.