skip to main content
10.1145/2975945.2975949acmconferencesArticle/Chapter ViewAbstractPublication PagesaseConference Proceedingsconference-collections
short-paper

Graph-based approach for detecting impure refactoring from version commits

Published:04 September 2016Publication History

ABSTRACT

Impure refactoring is defined as a refactoring operation that was saved together with non-refactoring changes or several refactoring operations were saved at the same location stored in source code repositories. Many of existing approaches are not correctly viable for detecting impure refactoring. To mitigate this problem, we propose an approach that detects impure refactoring from commits stored in the repositories using a graph search algorithm. In case study, we applied our approach to two actual classes in Apache Xerces project and confirmed the feasibility of the approach.

References

  1. G. Bavota, A. D. Lucia, M. D. Penta, R. Oliveto, and F. Palomba. An experimental investigation on the innate relationship between quality and refactoring. J. Syst. Softw., 107(C):1–14, Sept. 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Biegel, Q. D. Soetens, W. Hornig, S. Diehl, and S. Demeyer. Comparison of similarity metrics for refactoring detection. In Proc. of MSR, pages 53–62, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. G˝ org and P. Weissgerber. Detecting and visualizing refactorings from software archives. In Proc. of IWPC, pages 205–214, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. E. Hassan. The road ahead for mining software repositories. In Proc. of FoSM, pages 48–57, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  5. S. Hayashi, Y. Tsuda, and M. Saeki. Search-based refactoring detection from source code revisions. IEICE Trans. Inf. Syst., E93-D(4):754–762, apr 2010.Google ScholarGoogle Scholar
  6. V. Levenshtein. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady, 10:707, 1966.Google ScholarGoogle Scholar
  7. R. Mahouachi, M. Kessentini, and M. Ó Cinnéide. Search-based refactoring detection. In Proc. of GECCO Companion, pages 205–206, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. N. A. Milea, L. Jiang, and S.-C. Khoo. Vector abstraction and concretization for scalable detection of refactorings. In Proc. of FSE, pages 86–97, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. K. Prete, N. Rachatasumrit, N. Sudan, and M. Kim. Template-based reconstruction of complex refactorings. In Proc. of ICSM, pages 1–10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Z. Xing and E. Stroulia. Refactoring detection based on umldiff change-facts queries. In Proc. of WCRE, pages 263–274, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. N. Yoshida, T. Saika, E. Choi, A. Ouni, and K. Inoue. Revisiting the relationship between code smells and refactoring. In Proc. of ICPC, pages 48–57, 2016.Google ScholarGoogle ScholarCross RefCross Ref
  12. W. Zeng and R. L. Church. Finding shortest paths on real road networks: The case for A*. Int. J. Geogr. Inf. Sci., 23(4):531–543, Apr. 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Graph-based approach for detecting impure refactoring from version commits

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      IWoR 2016: Proceedings of the 1st International Workshop on Software Refactoring
      September 2016
      40 pages
      ISBN:9781450345095
      DOI:10.1145/2975945

      Copyright © 2016 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 4 September 2016

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • short-paper

      Upcoming Conference

    • Article Metrics

      • Downloads (Last 12 months)6
      • Downloads (Last 6 weeks)1

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader