- author = "Mathew James Hall",
- title = "Improving Software Remodularisation",
- school = "Department of Computer Science, University of Sheffield",
- year = "2013",
- address = "UK",
- month = mar,
- keywords = "genetic algorithms, genetic programming, SBSE, remodularisation, clustering, constraint solving, metaheuristic algorithms, reverse engineering, software engineering",
-
URL = "
https://etheses.whiterose.ac.uk/4183/",
-
URL = "
https://etheses.whiterose.ac.uk/4183/1/thesis.pdf",
-
URL = "https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577421",
-
URL = "https://www.sheffield.ac.uk/dcs/research/phd-theses#hall",
- size = "180 pages",
-
abstract = "Maintenance is estimated to be the most expensive
stage of the software development lifecycle. While
documentation is widely considered essential to reduce
the cost of maintaining software, it is commonly
neglected. Automated reverse engineering tools present
a potential solution to this problem by allowing
documentation, in the form of models, to be produced
cheaply.
State machines, module dependency graphs (MDGs), and other software models may be extracted automatically from software using reverse engineering tools. However the models are typically large and complex due to a lack of abstraction. Solutions to this problem use transformations (state machines) or remodularisation (MDGs) to enrich the diagram with a hierarchy to uncover the system structure.
This task is complicated by the subjectivity of the problem. Automated techniques aim to optimise the structure, either through design quality metrics or by grouping elements by the limited number of available features. Both of these approaches can lead to a mismatch between the algorithm output and the developer intentions. This thesis addresses the problem from two perspectives: firstly, the improvement of automated hierarchy generation to the extent possible, and then augmentation using additional expert knowledge in a refinement process.
Investigation begins on the application of remodularisation to the state machine hierarchy generation problem, which is shown to be feasible, due to the common underlying graph structure present in both MDGs and statemachines. Following this success, genetic programming is investigated as a means to improve upon this result, which is found to produce hierarchies that better optimise a quality metric at higher levels. The disparity between metric-maximising performance and human-acceptable performance is then examined, resulting in the SUMO algorithm, which incorporates domain knowledge to interactively refine a modularisation. The thesis concludes with an empirical user study conducted with 35 participants, showing, while its performance is highly dependent on the individual user, SUMO allows a modularization of a 122 file component to be refined in a short period of time (within an hour for most participants).",
-
notes = "uk.bl.ethos.577421
Supervisor: Dr Phil McMinn",
