Error Correcting Graph Matching Application to Software Evolution

  • Kpodjedo S
  • Ricca F
  • Galinier P
 et al. 
  • 7


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Graph representations and graph algorithms are widely adopted to model and resolve problems in many different areas from telecommunications, to bio-informatics, to civil and software engineering. Many software artefacts such as the class diagram can be thought of as graphs and thus, many software evolution problems can be reformulated as a graph matching problem.In this paper, we investigate the applicability of an error-correcting graph matching algorithm to object-oriented software evolution and report results, obtained on a small system - the Latazza application -, supporting applicability and usefulness of our proposal.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Segla Kpodjedo

  • Filippo Ricca

  • Philippe Galinier

  • Giuliano Antoniol

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free