Helly-type theorems and geometric transversals
Handbook of discrete and computational geometry
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Putting static analysis to work for verification: A case study
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Principles of Program Analysis
Principles of Program Analysis
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Data Structures and Algorithms
Data Structures and Algorithms
Focusing in Algorithm Explanation
IEEE Transactions on Visualization and Computer Graphics
Teaching Binary Tree Algorithms through Visual Programming
VL '96 Proceedings of the 1996 IEEE Symposium on Visual Languages
Future Perspectives - Introduction
Revised Lectures on Software Visualization, International Seminar
Algorithm animation using shape analysis: visualising abstract executions
SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Student-built algorithm visualizations for assessment: flexible generation, feedback and grading
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
A study of algorithm animations on mobile devices
Proceedings of the 38th SIGCSE technical symposium on Computer science education
Algorithm visualization using concrete and abstract shape graphs
Proceedings of the 4th ACM symposium on Software visualization
An appreciation of the work of Reinhard Wilhelm
Program analysis and compilation, theory and practice
| Hi-index | 0.00 |
Software visualization provides methods to facilitate the understanding of algorithms and programs. Practically all existing visualization systems actually execute the code to be visualized on sample input data. In this paper, we propose a novel approach to algorithm explanation based on static program analysis, specifically shape analysis. Shape analysis of a program operating on heap-based data structures analyzes the program to find out relevant properties of its heap contents. The shape analysis we are using is parameterized with sets of observation properties, which are relevant properties of heap elements. Shape analysis associates sets of shape graphs with program points. These graphs describe both structural properties and nonstructural properties such as sortedness. By summarizing sets of undistinguishable heap cells shape analysis supports focusing on active parts of the data structure. By computing the program's invariants it provides the basis for their visualization. After the application of the shape analysis the program is visually abstractly executed, i.e., traversed with a strategy corresponding to a meaningful explanation. Showing a sequence of shape graphs produced along a program path demonstrates how invariants are temporarily violated and then restored.