Synergistic debug-repair of heap manipulations
Synergistic debug-repair of heap manipulations
复制标题
堆操作的协同调试修复
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Subhajit Roy
中科院分区：
文献类型：
--
作者：
Sahil Verma;Subhajit Roy
我们介绍金刚狼，这是一种用于操纵计划的综合调试修复环境。金刚狼有助于通过混凝土程序执行，提供抽象程序状态（作为框和箭头图）的可视化，并集成了一种新颖的，证明的修复算法以合成修复补丁。为了提供无缝的环境，金刚狼支持生成的维修补丁的“热点”，从而使程序员能够继续进行调试会话，而无需流产的compile-debug循环。我们还提出了新的调试可能性，“规格改进”和“规格切片”，使金刚狼成为可能。我们在1600个错误的程序（使用故障注入生成）上评估了我们的框架，例如单个数据结构，例如单，双重和循环链接列表，二进制搜索树，Avl树，Avl树，红黑树和张开树；金刚狼可以在合理的时间内修复所有越野车实例（在大多数情况下不到5秒）。我们还评估了247（Buggy）学生意见书的金刚狼；金刚狼可以维修超过80％的学生进行合理尝试的计划。
We present Wolverine, an integrated Debug-Repair environment for heap manipulating programs. Wolverine facilitates stepping through a concrete program execution, provides visualizations of the abstract program states (as box-and-arrow diagrams) and integrates a novel, proof-directed repair algorithm to synthesize repair patches. To provide a seamless environment, Wolverine supports "hot-patching" of the generated repair patches, enabling the programmer to continue the debug session without requiring an abort-compile-debug cycle. We also propose new debug-repair possibilities, "specification refinement" and "specification slicing" made possible by Wolverine. We evaluate our framework on 1600 buggy programs (generated using fault injection) on a variety of data-structures like singly, doubly and circular linked-lists, Binary Search Trees, AVL trees, Red-Black trees and Splay trees; Wolverine could repair all the buggy instances within reasonable time (less than 5 sec in most cases). We also evaluate Wolverine on 247 (buggy) student submissions; Wolverine could repair more than 80% of programs where the student had made a reasonable attempt.