Empirical Software Engineering

, Volume 22, Issue 2, pp 670–715

Search-based detection of model level changes

  • Marouane Kessentini
  • Usman Mansoor
  • Manuel Wimmer
  • Ali Ouni
  • Kalyanmoy Deb
Article

DOI: 10.1007/s10664-016-9442-8

Cite this article as:
Kessentini, M., Mansoor, U., Wimmer, M. et al. Empir Software Eng (2017) 22: 670. doi:10.1007/s10664-016-9442-8

Abstract

Software models, defined as code abstractions, are iteratively refined, restructured, and evolved due to many reasons such as reflecting changes in requirements or modifying a design to enhance existing features. For understanding the evolution of a model a-posteriori, change detection approaches have been proposed for models. The majority of existing approaches are successful to detect atomic changes. However, composite changes, such as refactorings, are difficult to detect due to several possible combinations of atomic changes or eventually hidden changes in intermediate model versions that may be no longer available. Moreover, a multitude of refactoring sequences may be used to describe the same model evolution. In this paper, we propose a multi-objective approach to detect model changes as a sequence of refactorings. Our approach takes as input an exhaustive list of possible types of model refactoring operations, the initial model, and the revised model, and generates as output a list of refactoring applications representing a good compromise between the following two objectives (i) maximize the similarity between the expected revised model and the generated model after applying the refactoring sequence on the initial model, and (ii) minimize the number of atomic changes used to describe the evolution. In fact, minimizing the number of atomic changes can important since it is maybe easier for a designer to understand and analyze a sequence of refactorings (composite model changes) rather than an equivalent large list of atomic changes (Weissgerber and Diehl 2006). Due to the huge number of possible refactoring sequences, a metaheuristic search method is used to explore the space of possible solutions. To this end, we use the non-dominated sorting genetic algorithm (NSGA-II) to find the best trade-off between our two objectives. The paper reports on the results of an empirical study of our multi-objective model changes detection technique as applied on various versions of real-world models taken from open source projects and one industrial project. We compared our approach to the simple deterministic greedy algorithm, multi-objective particle swarm optimization (MOPSO), an existing mono-objective changes detection approach, and two model changes detection tools not based on computational search. The statistical test results provide evidence to support the claim that our proposal enables the generation of changes detection solutions with correctness higher than 85 %, in average, using a variety of real-world scenarios.

Keywords

Search-based software engineering Software maintenance Multi-objective optimization Model changes detection 

Funding information

Funder NameGrant NumberFunding Note
Ford Motor Company

    Copyright information

    © Springer Science+Business Media New York 2016

    Authors and Affiliations

    • Marouane Kessentini
      • 1
    • Usman Mansoor
      • 1
    • Manuel Wimmer
      • 2
    • Ali Ouni
      • 3
    • Kalyanmoy Deb
      • 4
    1. 1.University of MichiganDearbornUSA
    2. 2.Vienna University of TechnologyWienAustria
    3. 3.Osaka UniversityOsakaJapan
    4. 4.Michigan State UniversityEast LansingUSA

    Personalised recommendations