Propagating Bug Fixes with Fast Subgraph Matching

Boya Sun,Gang Shu,Andy Podgurski,Shirong Li,Shijie Zhang,Jiong Yang

Software Reliability Engineering（2010）

引用 17|浏览0

暂无评分

摘要

We present a powerful and efficient approach to the problem of propagating a bug fix to all the locations in a code base to which it applies. Our approach represents bug and fix patterns as subgraphs of a system dependence graph, and it employs a fast, index-based subgraph matching algorithm to discover unfixed bug-pattern instances remaining in a code base. We have also developed a graphical tool to help programmers specify bug patterns and fix patterns easily. We evaluated our approach by applying it to bug fixes in four large open-source projects. The results indicate that the approach exhibits good recall and precision and excellent efficiency.

查看译文

关键词

system dependence graph,subgraph matching,index-based subgraph,subgraph matching algorithm,good recall,graphical tool,code base,propagating bug fixes,efficient approach,program debugging,program dependence graph,graph indexing,excellent efficiency,detection,graph theory,large open-source project,bug fix,bug pattern,bug fix propagation,fast subgraph matching,pattern matching,indexing,algorithm design and analysis,indexation,data structures,computer bugs,labeling

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要