skip to main content
10.1145/2351676.2351726acmconferencesArticle/Chapter ViewAbstractPublication PagesaseConference Proceedingsconference-collections
Article

Refactorings without names

Published:03 September 2012Publication History

ABSTRACT

As with design patterns before, the naming and cataloguing of refactorings has contributed significantly to the recognition of the discipline. However, in practice concrete refactoring needs may deviate from what has been distilled as a named refactoring, and mapping these needs to a series of such refactorings — if at all possible — can be difficult. To address this, we propose a framework of specifying refactorings in an ad hoc fashion, and demonstrate its feasibility by presenting an implementation. Evaluation is done by simulating application through a user on a set of given sample programs. Results suggest that our proposal of ad hoc refactoring is, for the investigated scenarios at least, viable.

References

  1. M Fowler Refactoring: Improving the Design of Existing Code (Addison-Wesley 1999). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J Gosling, B Joy, G Steele, G Bracha The Java Language Specification ( http://java.sun.com/docs/books/jls/ ).Google ScholarGoogle Scholar
  3. G Gottlob, G Greco, T Mancini “Conditional constraint satisfaction: logical foundations and complexity” in: Proc. of IJCAI (2007) 88–93. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. F Steimann, A Thies “From public to private to absent: Refactoring Java programs under constrained accessibility” in: Proc. of ECOOP (2009) 419–443. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. F Steimann, C Kollee, J von Pilgrim “A refactoring constraint language and its application to Eiffel” in: Proc. of ECOOP (2011) 255–280. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. F Steimann, J von Pilgrim “Constraint-based refactoring with foresight” in: Proc. of ECOOP (2012) 535–559. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. F Tip, RM Fuhrer, A Kiezun, MD Ernst, I Balaban, B De Sutter “Refactoring using type constraints” ACM Trans. Program. Lang. Syst. 33(3):9 (2011). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Refactorings without names

        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
          ASE '12: Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
          September 2012
          409 pages
          ISBN:9781450312042
          DOI:10.1145/2351676

          Copyright © 2012 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: 3 September 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate82of337submissions,24%

          Upcoming Conference

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader