Differencing and merging of architectural views. Abi-Antoun, M., Aldrich, J., Nahas, N., Schmerl, B., & Garlan, D. Automated Software Engineering, 15(1):33-75, 2008.
abstract   bibtex   
Differencing and merging architectural views is an important activity in software engineering. However, existing approaches are still based on restrictive assumptions, such as requiring view elements to have unique identifiers or exactly matching types, which is often not the case in many application domains. We propose an approach based on structural information. We generalize a published polynomial-time tree-to-tree correction algorithm that detects inserts, renames and deletes, into a novel algorithm that additionally detects restricted moves. Our algorithm also supports forcing and preventing matches between view elements. We incorporate the algorithm into tools to compare and merge Component-and-Connector (C&C) architectural views. We provide an empirical evaluation of the algorithm. We illustrate the tools using extended examples, and use them to detect and reconcile interesting differences between real architectural views
@article{
 title = {Differencing and merging of architectural views},
 type = {article},
 year = {2008},
 keywords = {Graph matching,Tree-to-tree correction,View synchronization},
 pages = {33-75},
 volume = {15},
 websites = {http://link.springer.com/article/10.1007/s10515-007-0023-3},
 id = {154b3e02-20bb-3ea3-8e96-d3994333acfb},
 created = {2015-03-19T12:56:34.000Z},
 accessed = {2014-10-29},
 file_attached = {false},
 profile_id = {6b46cd49-f8a1-3799-91ac-6861cf9a050e},
 group_id = {aac22cc4-426b-3b7e-a56d-7d569a62ceed},
 last_modified = {2015-03-19T15:03:56.000Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 abstract = {Differencing and merging architectural views is an important activity in software engineering. However, existing approaches are still based on restrictive assumptions, such as requiring view elements to have unique identifiers or exactly matching types, which is often not the case in many application domains. We propose an approach based on structural information. We generalize a published polynomial-time tree-to-tree correction algorithm that detects inserts, renames and deletes, into a novel algorithm that additionally detects restricted moves. Our algorithm also supports forcing and preventing matches between view elements. We incorporate the algorithm into tools to compare and merge Component-and-Connector (C&C) architectural views. We provide an empirical evaluation of the algorithm. We illustrate the tools using extended examples, and use them to detect and reconcile interesting differences between real architectural views},
 bibtype = {article},
 author = {Abi-Antoun, Marwan and Aldrich, Jonathan and Nahas, Nagi and Schmerl, Bradley and Garlan, David},
 journal = {Automated Software Engineering},
 number = {1}
}

Downloads: 0