Complete and Partial Redex Trails of Functional Computations
Complete and Partial Redex Trails of Functional Computations
复制标题
函数计算的完整和部分 Redex 轨迹
DOI：
10.1007/bfb0055430
复制
发表时间：
1997
影响因子：
1.1
通讯作者：
C. Runciman
中科院分区：
文献类型：
--
作者：
Jan Sparud;C. Runciman
Redex Trails是通过还原绘制的功能计算的历史。他们的主要应用是故障追踪。基于Redex Trails [8]的示踪剂的原型实现证明了该技术的希望，但在两个方面受到限制：（1）步道并未记录所有减少，而只有那些构建新值的人； （2）即使如此，计算步道也非常昂贵，尤其是在它们所占据的记忆空间方面。在本文中，我们解决了这两个问题：完整的Redex Trails提供了完整的计算记录；这些小径的部分版本不包括所有选定的细节，大大降低了内存成本。我们包括追踪多个应用程序的实验结果，包括编译器。
Redex trails are histories of functional computations by graph reduction; their main application is fault-tracing. A prototype implementation of a tracer based on redex trails [8] demonstrated the promise of the technique, but was limited in two respects: (1) trails did not record every reduction, only those constructing a new value; (2) even so computing trails was very expensive, particularly in terms of the memory space they occupied. In this paper, we address both problems: complete redex trails provide a full computational record; partial versions of these trails exclude all but selected details, greatly reducing memory costs. We include results of experiments tracing several applications, including a compiler.