Conference Papers: Refactoring Class Hierarchies with KABA

[streckenbach04oopsla]

Mirko Streckenbach, Gregor Snelting, Refactoring Class Hierarchies with KABA, 19th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, Vancouver, British Columbia, Canada, October 2004.

Abstract

KABA is an innovative system for refactoring Java class hierarchies. It uses the Snelting/Tip algorithm in order to determine a behaviour-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 behaviour for all possible input values; the dynamic version guarantees preservation of behaviour for all runs in a given test suite. KABA offers automatic refactoring as well as manual refactoring using a dedicated editor.

Download

[PDF]

[DOI]

BibTeX

@inproceedings{streckenbach04oopsla,
  title = {Refactoring Class Hierarchies with KABA},
  booktitle = {19th Annual ACM Conference on Object-Oriented Programming, Systems,
 Languages, and Applications},
  year = {2004},
  month = oct,
  publisher = {ACM},
  author = {Mirko Streckenbach and Gregor Snelting},
  address = {Vancouver, British Columbia, Canada},
  doi = {10.1145/1028976.1029003},
}

Authors at the institute

Department Head
Prof. Gregor Snelting

Former Staff Member
Dr. rer. nat. Mirko Streckenbach

Projects

Project

KABA