Recommended
More Related Content
What's hot
What's hot (20)
Similar to Differences Between UML Diagrams Visualized
Similar to Differences Between UML Diagrams Visualized (20)
More from dhruvgairola
Recently uploaded
Recently uploaded (20)
Differences Between UML Diagrams Visualized
- 1. DIFFERENCES BETWEEN VERSIONS OF UML DIAGRAMS Ohst et. Al., ESEC/FSE’03 Dr. Maibaum Dhruv Gairola
- 2. Outline Problem. Differences between UML diagrams. Classification of differences. Computing differences. Conclusion.
- 3. Problem Text files easily handled by version control tools. What about binary files? How to detect differences?
- 4. Problem (2)
- 5. Problem (3)
- 6. Problem (4) What about UML diagrams stored in text formats? Usual methods not applicable e.g., different file contents can actually represent the same diagram, but systems might show large changes.
- 7. Differences between UML diagrams. Unified document model. Common parts are uncolored. Specific parts of each base document are colored. Assumptions : Documents are stored as syntax trees (e.g., XML files). Only consider diagrams where layout is irrelevant.
- 10. SiDiff
- 11. SiDiff (2)
- 12. SiDiff (3)
- 13. Classification of differences Intra-node differences. Structural differences. Deletion. Creation. Shifting.
- 14. Intra-node differences Differences between attributes of two corresponding nodes. Simple attributes e.g., changing the name of attribute. Multivalued/list attributes e.g., adding/removing attributes from list.
- 16. Intra node differences (2)
- 17. Structural differences Deletion/ creation/ shifting Shifts : Modifications to layout. Structural shifts (e.g. shifting an edge) Inter-node shifts (e.g. shifting an attribute) Position shifts (e.g. reordering a list of attributes)
- 18. Type of shifts (structural shift)
- 20. Type of shifts (inter-node shift)
- 21. Type of shifts (inter-node shift)
- 22. Type of shifts (position shift)
- 23. Computing the differences All elements are modelled as objects, forming an object graph. Algorithm simultaneously goes through two spanning trees (of the object graph) starting from the root.
- 24. Computing the differences (2) The composition relationships form a spanning tree of this graph.
- 25. Computing the differences (3) Assumption: the root is unchanged foreach level in spanningTree find corresponding sub-trees insert a new pair into the queue compare attributes and relations of the root create new object in a unified document End
- 26. Computing the differences (4) Algorithm can distinguish between creation/deletion and shifts. Lot of comparisons. Algorithm seems slow. They have some optimizations (not described).
- 27. Coloring Too many differences => Too many colors => Confusing. Solution : restrict to only subsets of differences. Non-interesting areas are greyed out. Restrictions are done based on type of elements or history of revisions.
- 28. Coloring (2)
- 29. Conclusion Need a way to present differences between versions of UML diagrams. Various types of differences exist and various ways to visualize these differences. ”Layered” approach in presenting differences.