An exploratory study of identifier renamings
Proceedings of the 8th Working Conference on Mining Software Repositories
Enhancing a tabu algorithm for approximate graph matching by using similarity measures
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
On the analysis of evolution of software artefacts and programs
Proceedings of the 34th International Conference on Software Engineering
Using local similarity measures to efficiently address approximate graph matching
Discrete Applied Mathematics
| Hi-index | 0.00 |
Analyzing the evolutionary history of the design of Object-Oriented Software is an important and difficult task where matching algorithms play a fundamental role. In this paper, we investigate the applicability of an error-correcting graph matching (ECGM) algorithm to object-oriented software evolution. By means of a case study, we report evidence of ECGM applicability in studying the Mozilla class diagram evolution. We collected 144 Mozilla snapshots over the past six years, reverse-engineered class diagrams and recovered traceability links between subsequent class diagrams. Our algorithm allows us to identify evolving classes that maintain a stable structure of relations(associations, inheritances and aggregations) with other classes and thus likely constitute the backbone of Mozilla.