首页> 外文期刊>Automatic Control and Computer Sciences >Tree Slicing: Finding Intertwined and Gapped Clones in One Simple Step
【24h】

Tree Slicing: Finding Intertwined and Gapped Clones in One Simple Step

机译:树木切片:一步之遥就能找到交织和缺口的克隆

获取原文
获取原文并翻译 | 示例
           

摘要

Most of software nowadays contain code duplication that leads to serious problems in software maintenance. A lot of different clone detection approaches have been proposed over the years to deal with this problem, but almost all of them do not consider semantic properties of the source code. We propose to reinforce traditional tree-based clone detection algorithm by using additional information about variable slices. This allows to find intertwined/gapped clones on variables; preliminary evaluation confirms applicability of our approach to real-world software.
机译:如今,大多数软件都包含代码重复,这会导致软件维护方面的严重问题。多年来,已经提出了许多不同的克隆检测方法来解决此问题,但是几乎所有方法都没有考虑源代码的语义属性。我们建议通过使用有关可变切片的其他信息来增强传统的基于树的克隆检测算法。这允许在变量上找到交织/有缺口的克隆。初步评估证实了我们的方法在实际软件中的适用性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号