Sabrina Uhrig
ABSTRACT
It is widely known that the general matching problem on graphs is a non-polynomial optimization problem. Thus all differencing algorithms we know of use heuristics to identify corresponding elements (e.g.[2],[6]) apart from those that rely on unique identifiers (e.g.[5],[3]). We wonder if an exact algorithm can be designed which computes a minimal cost matching between the elements of the class diagrams and which, although it shows a non-polynomial worst case behaviour, delivers its solution much faster in most cases. In this position paper we describe our ongoing work, the idea of an algorithm which works with estimated transformation costs in order to reduce the computation costs. The algorithm has not been implemented yet; it has only been manually tested on a few examples.
- S. Förtsch and B. Westfechtel. Differencing and merging of software diagrams - state of the art and challenges. In J. Filipe, B. Shishkow, and M. Helfert, editors, ICSOFT 2007 - Second International Conference on Software and Data Technologies. INSTICC, 2007.Google Scholar
- U. Kelter, J. Wehren, and J. Niere. A generic difference algorithm for UML models. In P. Liggesmeyer, K. Pohl, and M. Goedicke, editors, Software Engineering 2005, LNI 64, pages 105--116. GI, 2005.Google Scholar
- A. Mehra, J. C. Grundy, and J. G. Hosking. A generic approach to supporting diagram differencing and merging for collaborative design. In D. F. Redmiles, T. Ellman, and A. Zisman, editors, 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), pages 204--213. ACM, 2005. Google ScholarDigital Library
- K. Neumann and M. Morlock. Operations Research. Carl Hanser Verlag, 2002.Google Scholar
- J. Rho and C. Wu. An efficient version model of software diagrams. In Asia Pacific Software Engineering Conference, pages 236--243. IEEE Computer Society Press, 1998. Google ScholarDigital Library
- Z. Xing and E. Stroulia. UMLDiff: an algorithm for object-oriented design differencing. In D. F. Redmiles, T. Ellman, and A. Zisman, editors, 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), pages 54--65. ACM, 2005. Google ScholarDigital Library
Index Terms
- Matching class diagrams: with estimated costs towards the exact solution?
Recommendations
Towards three-dimensional representation and animation of UML diagrams
UML'99: Proceedings of the 2nd international conference on The unified modeling language: beyond the standardThe UML notation is intended to be drawn on two-dimensional surfaces. However, three-dimensional diagram layout and animation may improve comprehension of complex diagrams significantly. The paper concentrates on special UML diagram forms wellsuited for ...
Constraint Diagrams: A Step Beyond UML
TOOLS '99: Proceedings of the Technology of Object-Oriented Languages and SystemsThe Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An exception to this is the Object Constraint Language (OCL) which is ...
UML diagram refinement (focusing on class- and use case diagrams)
ICSE '17: Proceedings of the 39th International Conference on Software EngineeringLarge and complicated UML models are not useful, because they are difficult to understand. This problem can be solved by using several diagrams of the same system at different levels of abstraction. Unfortunately, UML does not define an explicit set of ...
Comments