Approximate Code Search in Program Histories
Authors:
- Saman BazrafshanSBSaman Bazrafshan
- Rainer KoschkeRKRainer Koschke
- Nils GodeNGNils Gode
- 1 October 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10951350,p. 109-118
Abstract
Very often a defect must be corrected not only in the current version of a program at one particular place but in many places and many other versions -- possibly even in different development branches. Consequently, we need a technique to efficiently locate all approximate matches of an arbitrary defective code fragment in the program's history as they may need to be fixed as well. This paper presents an approximate whole-program code search in multiple releases and branches. We evaluate this technique for real-world defects of various large and realistic programs having multiple releases and branches. We report runtime measurements and recall using varying levels of allowable differences of the approximate search.Keywords
This publication has 22 references indexed in Scilit:
- Fast and practical approximate string matchingInformation Processing Letters, 1996
- On-line construction of suffix treesAlgorithmica, 1995
- Multiple filtration and approximate pattern matchingAlgorithmica, 1995
- A sublinear algorithm for approximate keyword searchingAlgorithmica, 1994
- Sublinear approximate string matching and biological applicationsAlgorithmica, 1994
- Fast text searchingCommunications of the ACM, 1992
- Theoretical and empirical comparisons of approximate string matching algorithms1992
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- An efficient string matching algorithm withkdifferences for nudeotide and amino acid sequencesNucleic Acids Research, 1986
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976