Model comparison with GenericDiff

ASE'10 - Proceedings of the IEEE/ACM International Conference on Automated Software Engineering

Volumn , Issue , 2010, Pages 135-138

  Xing, Zhenchang ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Graph matching; Metamodel; Model differencing

Indexed keywords

DOMAIN SPECIFIC; GENERAL GRAPH; GRAPH MATCHINGS; MATCHING PROCESS; META MODEL; MODEL COMPARISON; MODEL PROPERTIES; NEW APPLICATIONS;

SOFTWARE ENGINEERING; SYNTACTICS;

GRAPH THEORY;

EID: 78649772792     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1858996.1859020     Document Type: Conference Paper

References (16)

1. C. Bron and J. Kerbosch. Algorithm 457: Finding all cliques of an undirected graph. Commun. ACM 16:575-577.
2. D. Conte et al. Thirty years of graph matching in pattern recognition. IJPRAI, pp. 265-298, 2004.
3. D. Gale and L.S. Shapley. College admissions and the stability of marriage. American Math., 69:9-14, 1962.
4. M. Gori and M. Maggini. Exact and appropriate graph matching using random walk. TPAMI'05 27(7):1100-1111.
5. S. Horwitz. Identifying the semantic and textual differences between two versions of a program. PLDI'90, pp. 234-246.
6. R.W. Irving et al. The hospitals/residents problem with ties. LNCS 1851, pp. 259-271, 2000.
7. G. Jeh and J. Widom. SimRank: A measure of structuralcontext similarity. KDD'02, pp. 538-543.
8. 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.
9. S. Nejati, M. Sabetzadeh, M. Chechik, S. Easterbrook and P. Zave. Matching and merging startcharts specifications. ICSE'07, pp. 54-64.
10. L. Page et al. The PageRank citation ranking: Brining order to the web. Technical Report, Stanford Info Lab, 1999.
11. K. Riesen et al.. Efficient suboptimal graph isomorphism. GbRPR'09, pp. 124-133.
12. J. Taylor. An Introduction to Error Analysis. 2nd edition. University Science Books, pp 166-168, 1997.
13. C. Treude, S. Berlik, S. Wenzel and U. Kelter. Difference computation of large models. ESEC/FSE'07, pp. 295-304.
14. Z. Xing and E. Stroulia. UMLDiff: An algorithm for object-oriented design differencing. ASE'05, PP. 54-65.
15. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. Int. Conf. on Data Mining, pp. 721, 2002.
16. EMF: http://www.eclipse.org/emft, 2010.