Himesis : a hierarchical subgraph matching kernel for model driven development

• Main Author: Provost, Marc, 1981-
• Format: Others
• Language: en
• Published: McGill University 2005
• Subjects: Computer Science.
• Online Access: http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=98772

Himesis is a complete yet minimal kernel for meta-modelling and model transformation, which consists of a specification of hierarchical graphs and in a highly efficient matching algorithm. Himesis graphs encode the essence of models: nodes, edges, containment, attributes, names and labels. There is a defined set of events which transform the graphs. Above all Himesis introduces an explicit notion of hierarchy, which allows the specification of formalisms which were very hard to meta-model in the past, such as graph grammars. Moreover, with containment, it is possible to couple and reuse existing formalisms. === Himesis implements HVF, a new matching algorithm based on the VF2 approach. HVF extends VF2 with hierarchy and with several optimization strategies. It was designed to support advanced features that are required for graph rewriting, such as matching from a context as well as negative application conditions. We show that HVF is a faster algorithm than VF2 for matching of flat graphs. HVF is particularly efficient when matching irregular graphs.