Making Smart Moves to Untangle Programs

We present a novel algorithm to improve the design of programs by removing circular dependencies between packages without completely collapsing the package structure. This is achieved by moving classes between packages. The algorithm is based on a scoring function that is used to select the classes...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Shah, S. M. A., Dietrich, J., McCartin, C.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a novel algorithm to improve the design of programs by removing circular dependencies between packages without completely collapsing the package structure. This is achieved by moving classes between packages. The algorithm is based on a scoring function that is used to select the classes to be moved. The algorithm is validated against several open source case studies. The results show that our algorithm improves the program structure and removes inter-package cycles.
ISSN:1534-5351
2640-7574
DOI:10.1109/CSMR.2012.44