Abstract
Successful algorithm visualization inherently provides a high level of abstraction, supplying an extra information on the semantics that is behind the code. The postulate of designing highly abstract visualizations is stated as being in a deep contradiction with postulate of automation of the designer’s work. The goal of the presented work is partial reconciling these two contradicted postulates. Some elements that significantly increase the level of abstraction may be introduced to the visualization in a strictly automatic mode. To obtain this result, an original method of algorithm animation based on data flow tracing is proposed. Its key idea is to acquire information by observing elementary operations of data flow. For dynamic analysis of nonlocal flows Petri net formalism is used. The new method has been successfully applied in an algorithm animation system Daphnis.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. H. Brown, “Zeus: A System for Algorithm Animation and Multi-View Editing”, Proc. Of IEEE Workshop on Visual Languages. Kobe, Japon, 1991, pp. 4–9.
M. H. Brown, “Exploring Algorithms Using Balsa II”, IEEE Computer, Vol. 21, N°5, 1988, pp. 14–36.
P. Crescenzi, C. Demetrescu, I. Finocchi, R. Petreschi, “Reversible execution and visualization of programs with LEONARDO”, Journal of Visual Languages and Computing, 11(2):125–150, 2000.
R. A. Duisberg, “Animated Graphical Interfaces Using Temporal Constraints”, Proc. of the ACM SIGGHI’86 Conf. Human Factors in Computing Systems, Boston, MA, 1986, pp.131–136.
V. Fix, S. Wiedenbeck, J. Scholtz, “Mental Representations of Programs by Novices and Experts”, Proc. of Inter CHI’93, Addison-Wesley, 1993, pp. 74–79.
J. Francik, Surveillance du flux des données dans l’animation des algorithmes. PhD thesis, University of Lille, Villeneuve d’Ascq, France, 1999.
J. Francik, Sledzenie przeplywu danych dla potrzeb animacji algorytmów (Data Flow Tracing for Algorithm Animation). PhD thesis, Technical University of Silesia, Gliwice, Poland, 1999.
J. Francik, “Algorithm Animation Pages”, http://www-zo.iinf.polsl.gliwice.pl/~jfrancik/aa
J. Francik, P. Szmal, F. Van de Veire, “Siamoa-A System for Visual Programming, Program Visualization and Debugging”, Proc. of Advanced Visual Interfaces AVI’ 98, ACM Press, L’Aquila, Italy, 1998, pp. 289–291.
J. Francik, P. Szmal, “Algorithm Animation and Debugging with the WinSanal System”, Proc. of IASTED Conference Applied Informatics, Innsbruck, Austria, 1997.
J. Francik, P. Szmal, “WinSanal: System animacji algorytmów dla potrzeb dydaktyki i inzynierii programowania”, Informatyka 7–8/1997.
D. Hart, E. Kraemer, G.-C. Roman, “Interactive Visual Exploration of Distributed Computations”, Washington University, Department of Computer Science, St. Louis, MO, 1997.
R.R. Henry, K.M. Whaley, B. Forstall, “The University of Washington Illustrating Compiler”, Proc. of The ACM SIGPLAN’90 Conference on Programming Language Design and Implementation, New York, 1990, pp. 223–233.
B. A. Myers, “Taxonomies of Visual Programming and Program Visualization”, Journal of Visual Languages and Computing, Vol. 1, 1990, pp. 97–123.
B.A. Myers, R. Chandhok, A. Sareen, “Automatic Data Visualization for Novice Pascal Programmers”, Proc. of The IEEE Workshop on Visual Languages, IEEE Computer Society Press, New York, NY, 1988, pp. 192–198.
A. Price, R. M. Baecker, I. S. Small, “A Principled Taxonomy of software Visualization”, Journal of Visual Languages and Computing, Vol. 4, 1993, pp. 211–266.
G. C. Roman, K. C. Cox, “Program Visualization: the Art of Mapping Programs to Pictures”, International Conference on Software Engineering, New York, 1992, pp. 412–420.
G. C. Roman, K. C. Cox, “Abstraction in Algorithm Animation”, Proc. of 1992 IEEE Workshop on Visual Languages, Los Alamitos, CA, 1992, pp. 18–24.
J. T. Stasko, J.B. Domingue, M.H. Brown, B.A. Price (eds), Software Visualization. Programming as a Multimedia Experience. The MIT Press, Massachusetts, 1998.
J. T. Stasko, C. Patterson, “Understanding and Characterizing Software Visualization Systems”, Proc. of IEEE Workshop on Visual Languages, Seattle, WA, 1992, pp. 3–10.
J. T. Stasko, “Animating algorithms with XTANGO”, SIGACT News, Vol. 23, Iss. 2, 1992, pp. 67–71.
J. T. Stasko, “The Path-Transition Paradigm: a Practical Methodology for Adding Animation to Program Interfaces”, Journal of Visual Languages and Computing, Vol. 1, No. 3, 1990, pp. 213–236.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Francik, J. (2002). Algorithm Animation Using Data Flow Tracing. In: Diehl, S. (eds) Software Visualization. Lecture Notes in Computer Science, vol 2269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45875-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-45875-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43323-1
Online ISBN: 978-3-540-45875-3
eBook Packages: Springer Book Archive