Journal of Software: Evolution and Process

Cover image for Vol. 25 Issue 2

Special Issue: Special Issue of the 13th European Conference on Software Maintenance and Reengineering (CSMR 2009)

February 2013

Volume 25, Issue 2

Pages 111–192

Issue edited by: Rudolf Ferenc, Jens Knodel, Andreas Winter

  1. Editorial

    1. Top of page
    2. Editorial
    3. Special Issue Papers
    1. You have free access to this content
  2. Special Issue Papers

    1. Top of page
    2. Editorial
    3. Special Issue Papers
    1. Cluster-based modularization of processes recovered from web applications (pages 113–138)

      Chiara Di Francescomarino, Alessandro Marchetto and Paolo Tonella

      Version of Record online: 20 SEP 2010 | DOI: 10.1002/smr.518

      Thumbnail image of graphical abstract

      In this paper we propose a technique for the reverse engineering of business processes enacted by software systems having a Web interface. The technique infers a BPMN representation of the implemented process by dynamically analyzing the execution of the application GUI and by clustering process elements according to four different criteria: structural, page-based, dependency-based and semantic-based. A case study shows the ability of the reverse engineering and clustering techniques to recover well-modularized processes. Copyright © 2010 John Wiley & Sons, Ltd.

    2. Studying software evolution of large object-oriented software systems using an ETGM algorithm (pages 139–163)

      Segla Kpodjedo, Filippo Ricca, Philippe Galinier, Giuliano Antoniol and Yann-Gaël Guéhéneuc

      Version of Record online: 27 SEP 2010 | DOI: 10.1002/smr.519

      Thumbnail image of graphical abstract

      This paper presents a graph matching approach for the study of Object-Oriented software systems' evolution. Class diagrams of different releases are modeled as directed graphs and matched using an Error-Tolerant Graph Matching (ETGM) algorithm. An extensive empirical evaluation of our algorithm using small (Rhino), medium (Azureus and ArgoUML), and large systems (Mozilla and Eclipse) show that it is accurate, fast, scalable and stable. Copyright © 2010 John Wiley & Sons, Ltd.

    3. Studying clone evolution using incremental clone detection (pages 165–192)

      Nils Göde and Rainer Koschke

      Version of Record online: 3 SEP 2010 | DOI: 10.1002/smr.520

      Thumbnail image of graphical abstract

      Traditionally, approaches to detect code clones—duplication inside the source code of a program—are limited to a single version of the program. We present an incremental clone detection algorithm which efficiently detects clones in multiple versions of a program, reusing results from the analysis of the previous version to detect clones in the current version. In addition, the algorithm creates a mapping between clones of consecutive versions allowing a fine-grained analysis of clone evolution. Copyright © 2010 John Wiley & Sons, Ltd.