DDD—a free graphical front-end for UNIX debuggers
ACM SIGPLAN Notices
An open graph visualization system and its applications to software engineering
Software—Practice & Experience - Special issue on discrete algorithm engineering
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Simplifying and Isolating Failure-Inducing Input
IEEE Transactions on Software Engineering
Drawing Large Graphs with H3Viewer and Site Manager
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
CC '00 Proceedings of the 9th International Conference on Compiler Construction
Isolating cause-effect chains from computer programs
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Isolating cause-effect chains from computer programs
ACM SIGSOFT Software Engineering Notes
Visualising Objects: Abstraction, Encapsulation, Aliasing, and Ownership
Revised Lectures on Software Visualization, International Seminar
Rostra: A Framework for Detecting Redundant Object-Oriented Unit Tests
Proceedings of the 19th IEEE international conference on Automated software engineering
Scale-free geometry in OO programs
Communications of the ACM - Adaptive complex enterprises
Locating causes of program failures
Proceedings of the 27th international conference on Software engineering
SOBER: statistical model-based bug localization
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Checking Inside the Black Box: Regression Testing by Comparing Value Spectra
IEEE Transactions on Software Engineering
Discriminative pattern mining in software fault detection
Proceedings of the 3rd international workshop on Software quality assurance
Dynamic heap type inference for program understanding and debugging
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Statistical Debugging: A Hypothesis Testing-Based Approach
IEEE Transactions on Software Engineering
BPGen: an automated breakpoint generator for debugging
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2
Heapviz: interactive heap visualization for program understanding and debugging
Proceedings of the 5th international symposium on Software visualization
A map of the heap: revealing design abstractions in runtime structures
Proceedings of the 5th international symposium on Software visualization
Tracking data structures for postmortem analysis (NIER track)
Proceedings of the 33rd International Conference on Software Engineering
ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I
CC'05 Proceedings of the 14th international conference on Compiler Construction
| Hi-index | 0.00 |
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.