DocumentCode
1683709
Title
Making Smart Moves to Untangle Programs
Author
Shah, Syed M Ali ; Dietrich, Jens ; McCartin, Catherine
Author_Institution
Sch. of Eng. & Adv. Technol., Massey Univ., Palmerston North, New Zealand
fYear
2012
Firstpage
359
Lastpage
364
Abstract
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.
Keywords
design; object-oriented programming; software packages; circular dependencies; package structure; program design; smart moves; untangle programs; Algorithm design and analysis; Graphical user interfaces; Image edge detection; Java; Measurement; Software; Software algorithms; Dependency graph; Java; circular dependencies; refactoring;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Maintenance and Reengineering (CSMR), 2012 16th European Conference on
Conference_Location
Szeged
ISSN
1534-5351
Print_ISBN
978-1-4673-0984-4
Type
conf
DOI
10.1109/CSMR.2012.44
Filename
6178880
Link To Document