More efficient automatic repair of large-scale programs using weak recompilation

• Published in: Science China. Information sciences 2012-12, Vol.55 (12), p.2785-2799
• Main Authors: Qi, YuHua, Mao, XiaoGuang, Wen, YanJun, Dai, ZiYing, Gu, Bin
• Format: Article
• Language: English
• Subjects: Computer Science; Information Systems and Communication Service; Repair; Research Paper; 修复系统; 修补程序; 可执行程序; 安装成本; 时间开销; 编译技术; 自动修复; 节目
• ISSN: 1674-733X; 1869-1919
• DOI: 10.1007/s11432-012-4741-1

Automatically repairing a bug can be a time-consuming process especially for large-scale programs owing to the significant amount of time spent recompiling and reinstalling the patched program. To reduce this time overhead and speed up the repair process, in this paper we present a recompilation technique called weak recompilation. In weak reeompilation~ we assume that a program consists of a set of components, and for each candidate patch only the altered components are recompiled to a shared library. The original program is then dynamically updated by a function indirection mechanism. The advantage of weak recompilation is that redundant recompilation cost can be avoided, and while the reinstallation cost is completely eliminated as the original executable program is not modified at all. For maximum applicability of weak recompilation we created WAutoRepair, a scalable system for fixing bugs with high eiciency in large-scale C programs. The experiments on real bugs in widely used programs show that our repair system significantly outperforms Genprog, a well- known approach to automatic program repair. For the wireshark program containing over 2 million lines of code, WAutoRepair is over 128 times faster in terms of recompilation cost than Genprog.