Files and links (1)
PDFOpen Access (License Unspecified), Open Access
Dissertation
A heuristic search approach to solving the software clustering problem
Doctor of Philosophy (Ph.D.), Drexel University
Mar 2002
DOI:
https://doi.org/10.17918/00010264
Abstract
Most interesting software systems are large and complex, and as a consequence, understanding their structure is difficult. One of the reasons for this complexity is that source code contains many entities (e.g., classes, modules) that depend on each other in intricate ways (e.g., procedure calls, variable references). Additionally, once a software engineer understands a system's structure, it is difficult to preserve this understanding, because the structure tends to change during maintenance. Research into the software clustering problem has proposed several approaches to deal with the above issue by defining techniques that partition the structure of a software system into subsystems (clusters). Subsystems are collections of source code resources that exhibit similar features, properties or behaviors. Because there are far fewer subsystems than modules, studying the subsystem structure is easier than trying to understand the system by analyzing the source code manually. Our research addresses several aspects of the software clustering problem. Specifically, we created several heuristic search algorithms that automatically cluster the source code into subsystems. We implemented our clustering algorithms in a tool named Bunch, and conducted extensive evaluation via case studies and experiments. Bunch also includes a variety of services to integrate user knowledge into the clustering process, and to help users navigate through complex system structures manually. Since the criteria used to decompose the structure of a software system into subsystems vary across different clustering algorithms, mechanisms that can compare different clustering results objectively are needed. To address this need we first examined two techniques that have been used to measure the similarity between system decompositions, and then created two new similarity measurements to overcome some of the problems that we discovered with the existing measurements. Similarity measurements enable the results of clustering algorithms to be compared to each other, and preferably to be compared to an agreed upon "benchmark" standard. Since benchmark standards are not documented for most systems, we created another tool, called CRAFT, that derives a "reference decomposition" automatically by exploiting similarities in the results produced by several different clustering algorithms.
Metrics
34 File views/ downloads
31 Record Views
Details
- Title
- A heuristic search approach to solving the software clustering problem
- Creators
- Brian S. Mitchell
- Contributors
- Spiros Mancoridis (Advisor) - Drexel University, Drexel University (1970-)
- Awarding Institution
- Drexel University
- Degree Awarded
- Doctor of Philosophy (Ph.D.)
- Publisher
- Drexel University; Philadelphia, Pennsylvania
- Number of pages
- xiii, 262 pages
- Resource Type
- Dissertation
- Language
- English
- Academic Unit
- College of Arts and Sciences; Mathematics and Computer Science [Historical]; Drexel University
- Other Identifier
- 991021888988704721