Visualizing memory graphs

DOI10.1007/3-540-45875-1_15MaRDI QIDQ4471647zbMATH OpenFDO

Authors Thomas Zimmermann, Andreas Zeller

Publication date 30 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2269/22690191.htm

zbMATH Keywords

data types and structuresdebugging aidsdiagnosticsgraphsprogram understanding

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Computing methodologies and applications (68U99)

Recommendations

• Algorithm explanation: Visualizing abstract states and invariants
• Visualizing the execution of Java programs
• Call graph and control flow graph visualization for developers of embedded applications
• Program monitoring and visualization. An exploratory approach
• Visualizing the memory access behavior of shared memory applications on NUMA architectures

Cited in

(6)

• A system on visualization of program executive path and extraction of path sets
• Visualizing the memory access behavior of shared memory applications on NUMA architectures
• A glimpse of complex maps with memory
• Visualizing the execution of Java programs
• Algorithm explanation: Visualizing abstract states and invariants
• scientific article; zbMATH DE number 1863562 (Why is no real title available?)

This page was built for publication: Visualizing memory graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471647)