Recurring bug fixes in object-oriented programs
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Detection of recurring software vulnerabilities
Proceedings of the IEEE/ACM international conference on Automated software engineering
DELTA: indexing and querying multi-labeled graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
We present empirical results indicating that when programmers fix bugs, they often fail to propagate the fixes to all of the locations in a code base where they are applicable, thereby leaving instances of the bugs in the code. We propose a practical approach to help programmers to propagate many bug fixes completely. This entails first extracting a programming rule from a bug fix, in the form of a graph minor of an enhanced procedure dependence graph. Our approach assists the programmer in specifying rules by automatically matching simple rule templates; the programmer may also edit rules or compose them from scratch. A graph matching algorithm for detecting rule violations is then used to locate the places in the code base where the bug fix is applicable. Our approach does not require thatrules occur repeatedly in the code base. We present empirical results indicating that the approach nevertheless exhibits good precision.