PaReco: patched clones and missed patches among the divergent variants of a software family
Abstract
Re-using whole repositories as a starting point for new projects is often done by maintaining a variant fork parallel to the original. However, the common artifacts between both are not always kept up to date. As a result, patches are not optimally integrated across the two repositories, which may lead to sub-optimal maintenance between the variant and the original project. A bug existing in both repositories can be patched in one but not the other (we see this as a missed opportunity) or it can be manually patched in both probably by different developers (we see this as effort duplication). In this paper we present a tool (named PaReCo) which relies on clone detection to mine cases of missed opportunity and effort duplication from a pool of patches. We analyzed 364 (source to target) variant pairs with 8,323 patches resulting in a curated dataset containing 1,116 cases of effort duplication and 1,008 cases of missed opportunities. We achieve a precision of 91%, recall of 80%, accuracy of 88%, and F1-score of 85%. Furthermore, we investigated the time interval between patches and found out that, on average, missed patches in the target variants have been introduced in the source variants 52 weeks earlier. Consequently, PaReCo can be used to manage variability in “time” by automatically identifying interesting patches in later project releases to be backported to supported earlier releases.
BibTeX
@inproceedings{Ramkisoen-al:FSE22,
author = {Poedjadevie Kadjel Ramkisoen and
John Businge and
Brent van Bladel and
Alexandre Decan and
Serge Demeyer and
Coen De Roover and
Foutse Khomh},
title = {{PaReco:} patched clones and missed patches among the divergent variants of a software family},
booktitle = {{ESEC/SIGSOFT} {FSE}},
pages = {646--658},
publisher = {{ACM}},
year = {2022},
}