kirancodes.me
To Proof Maintenance & Beyond!

Difference computation of large models

Christoph Treude, Stefan Berlik, Sven Wenzel, Udo Kelter

Abstract

Modern software engineering practices lead to large models which exist in many versions. Version management systems should offer a service to compare, and possibly merge, these models. The computation of a difference between large models is a big challenge; current algorithms are too inefficient here. We present a new technique for computing differences between models. In practical tests, this technique has been an order of magnitude faster than currently known algorithms. The main idea is to use a high-dimensional search tree for efficiently finding similar model elements. Individual elements are mapped onto a vector of numerical values using a collection of metrics for models and a numerical representation of the names which occur in a model.

BibTeX
@inproceedings{Treude-al:FSE07,
  author    = {Christoph Treude and
               Stefan Berlik and
               Sven Wenzel and
               Udo Kelter},
  title     = {Difference computation of large models},
  booktitle = {{ESEC/SIGSOFT} {FSE}},
  pages     = {295--304},
  publisher = {{ACM}},
  year      = {2007},
}

Related papers