2009 13th European Conference on Software Maintenance and Reengineering 2009
DOI: 10.1109/csmr.2009.24
|View full text |Cite
|
Sign up to set email alerts
|

Recovering the Evolution Stable Part Using an ECGM Algorithm: Is There a Tunnel in Mozilla?

Abstract: 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 errorcorrecting graph matching (ECGM) algorithm to objectoriented 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 an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
26
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
4
3
1

Relationship

4
4

Authors

Journals

citations
Cited by 18 publications
(27 citation statements)
references
References 11 publications
1
26
0
Order By: Relevance
“…For example, Kpodjedo et al [20] proposed to identify all files that do not change in the history of a program, using an Error Tolerant Graph Matching algorithm. They studied the evolution of the Mozilla class diagram by collecting 144 Mozilla snapshots over six years, reverse-engineering their class diagrams, and recovering traceability links between subsequent class diagrams.…”
Section: A File Stabilitymentioning
confidence: 99%
“…For example, Kpodjedo et al [20] proposed to identify all files that do not change in the history of a program, using an Error Tolerant Graph Matching algorithm. They studied the evolution of the Mozilla class diagram by collecting 144 Mozilla snapshots over six years, reverse-engineering their class diagrams, and recovering traceability links between subsequent class diagrams.…”
Section: A File Stabilitymentioning
confidence: 99%
“…Kpodjedo et al [32] [18] proposed to identify all classes that do not change in the history of a program, using an Error Correcting Graph Matching algorithm (ECGM). They studied the evolution of programs and recovered traceability links between subsequent class diagrams.…”
Section: Class Evolutionmentioning
confidence: 99%
“…Their approach does not support relationships. Kpodjedo et al [6] proposed an Error Correcting Graph Matching (ECGM) algorithm to study architectural diagram evolution. This algorithm is derived from searchbased techniques: given two architectural diagrams D 1 and D 2 , the authors aims finding, among the large set of all possible matchings, a solution that is the best true matching between classes of D 1 and D 2 .…”
Section: B Architectural Diagram Evolutionmentioning
confidence: 99%
“…Then, for each target class {C B 1 , ...,C B n }, we compare ND and CamelS similarities to given thresholds. If none of the target classes has ND lower than the 0.40 threshold 5 and CamelS higher than the 0.50 threshold 6 . Then, we can consider that class C A was deleted and not renamed.…”
Section: ) Combination Of Similaritiesmentioning
confidence: 99%
See 1 more Smart Citation