[PDF][PDF] Clone Detection vs. Pattern Mining: The Battle.
In this paper we compare two approaches to discover recurrent fragments in source code:
clone detection and frequent subtree mining. We apply both approaches to a mediumsized
Java case and compare qualitatively and quantitatively their results in terms of what types of
code fragments are detected, as well as their size, relevance, coverage, and level of detail.
We conclude that both approaches are complementary, while existing overlap may be used
for cross-validation of the approaches.
clone detection and frequent subtree mining. We apply both approaches to a mediumsized
Java case and compare qualitatively and quantitatively their results in terms of what types of
code fragments are detected, as well as their size, relevance, coverage, and level of detail.
We conclude that both approaches are complementary, while existing overlap may be used
for cross-validation of the approaches.
Abstract
In this paper we compare two approaches to discover recurrent fragments in source code: clone detection and frequent subtree mining. We apply both approaches to a mediumsized Java case and compare qualitatively and quantitatively their results in terms of what types of code fragments are detected, as well as their size, relevance, coverage, and level of detail. We conclude that both approaches are complementary, while existing overlap may be used for cross-validation of the approaches.
academia.edu
以上显示的是最相近的搜索结果。 查看全部搜索结果