A case study of cross-system porting in forked projects
Authors:
Open Access
- 11 November 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Abstract
Software forking---creating a variant product by copying and modifying an existing product---is often considered an ad hoc, low cost alternative to principled product line development. To maintain such forked products, developers often need to port an existing feature or bug-fix from one product variant to another. As a first step towards assessing whether forking is a sustainable practice, we conduct an in-depth case study of 18 years of the BSD product family history. Our study finds that maintaining forked projects involves significant effort of porting patches from other projects. Cross-system porting happens periodically and the porting rate does not necessarily decrease over time. A significant portion of active developers participate in porting changes from peer projects. Surprisingly, ported changes are less defect-prone than non-ported changes. Our work is the first to comprehensively characterize the temporal, spatial, and developer dimensions of cross-system porting in the BSD family, and our tool Repertoire is the first automated tool for detecting ported edits with high accuracy of 94% precision and 84% recall. Our study finds that the upkeep work of porting changes from peer projects is significant and currently, porting practice seems to heavily depend on developers doing their porting job on time. This result calls for new techniques to automate cross-system porting to reduce the maintenance cost of forked projects.Keywords
Funding Information
- Division of Computing and Communication Foundations (CCF-1117902CCF-1149391CCF-1043810)
This publication has 23 references indexed in Scilit:
- Exploring Large-Scale System Similarity Using Incremental Clone Detection and Live Scatterplots2011
- Generic Patch Inference2008
- Understanding collateral evolution in Linux device drivers2006
- How Developers Copy2006
- An empirical study of code clone genealogies2005
- Measuring Similarity of Large Software Systems Based on Source Code Correspondence2005
- CCFinder: a multilinguistic token-based code clone detection system for large scale source codeIEEE Transactions on Software Engineering, 2002
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- The use of an association measure based on character structure to identify semantically related pairs of words and document titlesInformation Storage and Retrieval, 1974
- Significance Testing of the Spearman Rank Correlation CoefficientJournal of the American Statistical Association, 1972