Issue No. 01 - January-March (2000 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2945.841117
<p><b>Abstract</b>—<it>Algorithm Animation</it> attempts to explain an algorithm by visualizing <it>interesting events</it> of the execution of the implemented algorithm on some sample input. <it>Algorithm Explanation</it> describes the algorithm on some adequate level of abstraction, states invariants, explains how important steps of the algorithm preserve the invariants, and abstracts from the input data up to the relevant properties. It uses a small <it>focus</it> onto the execution state. This paper is concerned with the explanation of algorithms on linked data structures. The thesis of the paper is that <it>shape analysis</it> of such algorithms produces abstract representations of such data structures, which focus on the “active” parts, i.e., the parts of the data structures, which the algorithm can access during its next steps. The paper presents a concept of visually executing an algorithm on these abstract representations of data.</p>
Visualization of algorithms, shape analysis, diagrammatic reasoning.
B. Braune and R. Wilhelm, "Focusing in Algorithm Explanation," in IEEE Transactions on Visualization & Computer Graphics, vol. 6, no. , pp. 1-7, 2000.