ACM Home Page
Please provide us with feedback. Feedback
Refactoring class hierarchies with KABA
Full text PdfPdf (371 KB)
Source Conference on Object Oriented Programming Systems Languages and Applications archive
Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications table of contents
Vancouver, BC, Canada
SESSION: Advanced design table of contents
Pages: 315 - 330  
Year of Publication: 2004
ISBN:1-58113-831-9
Also published in ...
Authors
Mirko Streckenbach  Universität Passau, Passau, Germany
Gregor Snelting  Universität Passau, Passau, Germany
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 56,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1028976.1029003
What is a DOI?

ABSTRACT

KABA is an innovative system for refactoring Java class hierar-chies. It uses the Snelting/Tip algorithm [13] in order to determine a behavior-preserving refactoring which is optimal with respect to a given set of client programs. KABA can be based on dynamic as well as static program analysis. The static variant will preserve program behavior for all possible input values; the dynamic version guarantees preservation of behavior for all runs in a given test suite. KABA offers automatic refactoring as well as manual refactoring using a dedicated editor.

In this contribution, we recapitulate the Snelting/Tip algorithm, present the new dynamic version, and explain new extensions which allow to handle full Java. We then present five case studies which discuss the KABA refactoring proposals for programs such as javac and antlr. KABA proved that javac does not need refactoring, but generated semantics-based refactoring proposals for antlr.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
E. Casais. Automatic reorganization of object-oriented hierarchies: A case study. Object-Oriented Systems, 1(2):95--115, 1994.
 
5
M. Fowler. Refactoring. Addison-Wesley, 1999.
 
6
 
7
 
8
O. Lhotak and L. Hendren. Scaling Java points-to using Sparc. In Compiler Construction, 12th International Conference, LNCS, pages 153--169, 2003.
9
10
11
 
12
P. Schneider. Umsetzung von Transformationen an Klassenhierarchien in der Sprache JAVA. Master's thesis, Universität Passau, 2003.
13
 
14
M. Streckenbach. Points-to-Analyse für Java. Technical Report MIP-0011, Fakultät für Mathematik und Informatik, Universität Passau, 2000.
15
 
16
F. Tip, G. Snelting, and R. Johnson. Program analysis for object-oriented evolution. Technical report, Dagstuhl Seminar Report 03091, 2003.
 
17
18

CITED BY  10


REVIEW

"Michael G. Murphy : Reviewer"

KABA (klassenanalyse mit begriffsanalyse) is an innovative system for refactoring Java class hierarchies that uses the Snelting/Tip algorithm to determine a refactoring that is both behavior preserving and optimal, with respect to a given set of c  more...

Collaborative Colleagues:
Mirko Streckenbach: colleagues
Gregor Snelting: colleagues