Specifying algorithm visualizations: Interesting events or state mapping? (English) Zbl 1043.68876

Diehl, Stephan (ed.), Software visualization. International seminar Dagstuhl Castle, Germany, May 20–25, 2001. Revised papers. Berlin: Springer (ISBN 3-540-43323-6). Lect. Notes Comput. Sci. 2269, 16-30 (2002).
Summary: Perhaps the most popular approach to animating algorithms consists of identifying interesting events in the implementation code, corresponding to relevant actions in the underlying algorithm, and turning them into graphical events by inserting calls to suitable visualization routines. Another natural approach conceives algorithm animation as a graphical interpretation of the state of the computation of a program, letting graphical objects in a visualization depend on a program’s variables. In this paper we provide the first direct comparison of these two approaches, identifying scenarios where one might be preferable to the other. The discussion is based on examples realized with the systems Polka and Leonardo.
For the entire collection see [Zbl 0987.68756].


68U99 Computing methodologies and applications
68N01 General topics in the theory of software
Full Text: Link