Zhenchang Xing
ABSTRACT
This paper proposes GenericDiff, a general framework for model comparison. The main idea is to separate the specification of domain-specific model properties and syntax from the general graph matching process and to use composite numeric vectors and pairup graph to encode the domain-specific properties and syntax so that they can be uniformly exploited in the general matching process. Our initial evaluation demonstrates that it is easy to deploy GenericDiff in a new application domain and GenericDiff is able to produce an accurate comparison reports for diverse types of models.
- }}C. Bron and J. Kerbosch. Algorithm 457: Finding all cliques of an undirected graph. Commun. ACM 16:575--577. Google Scholar
Digital Library
- }}D. Conte et al. Thirty years of graph matching in pattern recognition. IJPRAI, pp. 265--298, 2004.Google ScholarCross Ref
- }}D. Gale and L. S. Shapley. College admissions and the stability of marriage. American Math., 69:9--14, 1962.Google Scholar
- }}M. Gori and M. Maggini. Exact and appropriate graph matching using random walk. TPAMI'05 27(7):1100--1111. Google ScholarDigital Library
- }}S. Horwitz. Identifying the semantic and textual differences between two versions of a program. PLDI'90, pp. 234--246. Google ScholarDigital Library
- }}R. W. Irving et al. The hospitals/residents problem with ties. LNCS 1851, pp. 259--271, 2000. Google ScholarDigital Library
- }}G. Jeh and J. Widom. SimRank: A measure of structural-context similarity. KDD'02, pp. 538--543. Google ScholarDigital Library
- }}S. Melnik, H.C. Molina, E. Rahm, Similarity flooding: A versatile graph matching algorithm and its application to schema matching. ICDE'02, pp. 177--186. Google ScholarDigital Library
- }}S. Nejati, M. Sabetzadeh, M. Chechik, S. Easterbrook and P. Zave. Matching and merging startcharts specifications. ICSE'07, pp. 54--64. Google ScholarDigital Library
- }}L. Page et al. The PageRank citation ranking: Brining order to the web. Technical Report, Stanford Info Lab, 1999.Google Scholar
- }}K. Riesen et al. Efficient suboptimal graph isomorphism. GbRPR'09, pp. 124--133. Google ScholarDigital Library
- }}J. Taylor. An Introduction to Error Analysis. 2nd edition. University Science Books, pp 166--168, 1997.Google Scholar
- }}C. Treude, S. Berlik, S. Wenzel and U. Kelter. Difference computation of large models. ESEC/FSE'07, pp. 295--304. Google ScholarDigital Library
- }}Z. Xing and E. Stroulia. UMLDiff: An algorithm for object-oriented design differencing. ASE'05, PP. 54--65. Google ScholarDigital Library
- }}X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. Int. Conf. on Data Mining, pp. 721, 2002. Google ScholarDigital Library
- }}EMF: http://www.eclipse.org/emft, 2010.Google Scholar
Index Terms
- Model comparison with GenericDiff
Recommendations
Edge-coloring almost bipartite multigraphs
Bipartite multigraphs have chromatic index equal to the largest degree d. We consider multigraphs obtained by inserting k vertices in edges of a connected bipartite multigraph, and show that the chromatic index may increase to at most d+1. We further ...
Interactive graph matching and visual comparison of graphs and clustered graphs
AVI '12: Proceedings of the International Working Conference on Advanced Visual InterfacesWe introduce interactive graph matching, a process that conciliates visualization, interaction and optimization approaches to address the graph matching and graph comparison problems as a whole. Interactive graph matching is based on a multi-layered ...
Working with the HL7 metamodel in a Model Driven Engineering context
Display Omitted The new domain models exploitation paradigm: Model Driven Engineering.The challenge of use the HL7 metamodel in the MDE context.Software engineers will use the benefits of HL7 standards and UML & MDE existing tools. HL7 (Health Level 7) ...
Comments