Detecting conflicts between structure accesses
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Analysis of pointers and structures
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Animating algorithms with XTANGO
ACM SIGACT News
A lattice for abstract interpretation of dynamic (LISP-like) structures
Information and Computation
Solving shape-analysis problems in languages with destructive updating
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solving shape-analysis problems in languages with destructive updating
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiler Design
Principles of Program Analysis
Principles of Program Analysis
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analysis of Dynamic Structures for Efficient Parallel Execution
Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
Diagrammatic Reasoning About Linked Lists
PRICAI '98 Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
Animation der semantischen Analyse
INFOS '99 Informatik und Schule, Fachspezifische und fachübergreifende didaktische Konzepte, 8. GI-Fachtagung Informatik und Schule
Animation of the Generation and Computation of Finite Automata for Learning Software
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
A system for algorithm animation
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Analysis of recursive types in an imperative language
Analysis of recursive types in an imperative language
Protocol animation based on event-driven visualization scenarios in real-time LOTOS
Computer Networks: The International Journal of Computer and Telecommunications Networking - Protocol animation
Future Perspectives - Introduction
Revised Lectures on Software Visualization, International Seminar
Algorithm Explanation: Visualizing Abstract States and Invariants
Revised Lectures on Software Visualization, International Seminar
Novel algorithm explanation techniques for improving algorithm teaching
SoftVis '06 Proceedings of the 2006 ACM symposium on Software visualization
An appreciation of the work of Reinhard Wilhelm
Program analysis and compilation, theory and practice
International Journal of e-Collaboration
| Hi-index | 0.00 |
Algorithm Animation attempts to explain an algorithm by visualizing interesting events of the execution of the implemented algorithm on some sample input. Algorithm Explanation 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 focus onto the execution state. This paper is concerned with the explanation of algorithms on linked data structures. The thesis of the paper is that shape analysis 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.