Refactoring Class Hierarchies with KABA
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.
| Zugehörige Institution(en) am KIT | Institut für Programmstrukturen und Datenorganisation (IPD) |
| Publikationstyp | Proceedingsbeitrag |
| Publikationsjahr | 2004 |
| Sprache | Englisch |
| Identifikator | ISBN: 1-58113-831-9 KITopen-ID: 1000017673 |
| Erschienen in | Proceedings of the 19th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vancouver, BC, Canada, October 24 - 28, 2004 |
| Verlag | Association for Computing Machinery (ACM) |
| Seiten | 315 - 330 |