Focusing in Algorithm Explanation
Focusing in Algorithm Explanation
复制标题
聚焦算法讲解
DOI：
10.1109/2945.841117
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
R. Wilhelm
中科院分区：
文献类型：
--
作者：
Beatrix Braune;R. Wilhelm
算法动画试图通过可视化在某些示例输入上执行算法的有趣事件来解释算法。算法解释在某种适当的抽象级别上描述了算法，说明了不变量，解释了算法的重要步骤如何保留不变量，并从输入数据抽象到相关属性。它稍微关注执行状态。本文涉及链接数据结构算法的解释。本文的主题是，此类算法的形状分析会产生此类数据结构的抽象表示，这些表示集中于“活动”部分，即算法在后续步骤中可以访问的数据结构部分。本文提出了在这些抽象数据表示上可视化执行算法的概念。
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 it's next steps. The paper presents a concept of visually executing an algorithm on these abstract representations of data.