期刊文献+

一种模型重构冲突消解算法

Model Refactoring Conflict Resolution Algorithm
在线阅读 下载PDF
导出
摘要 冲突是研究模型重构中的一个重要问题,多数研究将该问题的重点放在冲突检测上,通过对已知冲突的分析,找出冲突消解的手工实现方式。为实现模型重构的自动过程而寻找自动消解冲突的方法是主要研究内容。根据冲突发生的条件将冲突分为3种类型:同一规则的并行使用产生的冲突、对称冲突、非对称冲突。该方法建立在手工分析这3类重构冲突消解的基础上,将重构规则预设为一个规则矩阵,对图转换系统中出现的重构规则进行扫描。扫描结果对照规则矩阵,判断冲突是同一规则还是不同规则的并行使用所产生;分别对这两种情况下的冲突所操作的对象进行分析,根据已有手工消解方法有针对性地进行消解操作。这一算法可以初步实现并行执行的3类冲突的自动消解。 Conflict resolution is a key problem in research of model refactoring, while the majority of researchers focus on conflicts detection. Conflict resolution is usually performed manually after being analyzed known conflicts. Three categories of conflicts could be resolved which include conflict of parallel applications of the same rule, symmetric conflict and asymmetric conflict. This paper concentrated on automating conflicts resolution so as to realize the automatic model refactoring. This method provides an integrated algorithm based on manual analysis of three categories of conflicts. The basic automatic resolution algorithm within refactoring according to the cause of the conflicts (the application of either the same rule or the different ones), divides the conflicts and then resolves them correspondingly. This algorithm could preliminarily realize the automatic resolution of conflicts mentioned which are caused by the parallel application of refactoring rules.
出处 《计算机科学》 CSCD 北大核心 2010年第7期141-143,173,共4页 Computer Science
基金 河海大学自然科学基金项目(理科类)(2008432311) 国家科技支撑计划(2008BA29B03)资助
关键词 模型重构 关键对 冲突 冲突消解 算法 Model refactoring,Critical pairs,Conflict, Conflict resolution, Algorithm
  • 相关文献

参考文献10

  • 1Corradini A,Montanari U,Rossi F,et al.Algebraic approaches to graph transformation I:Basic concepts and double pushout approach[C] ∥Rozenberg G.editor.Handbook of Graph Grammars and Computing by Graph transformation.Volume 1:Foundations.World Scientific,1997.
  • 2Mens T.On the use of graph transformations for model refactoring[C] ∥Generative and Transformational Techniques in Software Engineering.LNCS 4143.Springer,2006:219-257.
  • 3Mens T,Van Eetvelde N,Demeyer S,et al.Formalizing refacto-rings with graph transformations[J].Journal on Software Maintenance and Evolution,2005,17(4):247-276.
  • 4Habel A,Hoffmann B.Parallel Independence in Hierarchical Graph Transformation[M].ICGT,2004:178-193.
  • 5Taentzer TG,Runge O.Detecting structural refactoring conflicts using critical pair analysis[J].Electronic Notes in Theoretical Computer Science,2005,127(3):113-128.
  • 6Plump D.Critical pairs in term graph rewriting[C] ∥Proc.Mathematical.Foundations of Computer Science.volume 841 of Lecture Notes in Computer.London,UK:Springer-Verlag,1994.
  • 7Mens T.A formal foundation for object-oriented software evolution[D].Department of Computer Science,Vrije Universiteit Brussel,September 1999.
  • 8http:∥user.cs.tu-berlin.de/-gragra/agg/critical_pairs.html.
  • 9刘辉,麻志毅,邵维忠.模型转换中特性保持的描述与验证[J].软件学报,2007,18(10):2369-2379. 被引量:19
  • 10Lambers L,Ehrig H,Orejas F.Efficient detection of conflicts in graph-based model transformation[C] ∥Proc.International Workshop on Graph and Model Transformation (GraMoT'05).Electronic Notes in Theoretical Computer Science,Tallinn,Estonia,Elsevier Science,2005.

二级参考文献1

共引文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部