首页> 外文会议>International symposium on search based software engineering >Automated Co-evolution of Metamodels and Transformation Rules: A Search-Based Approach
【24h】

Automated Co-evolution of Metamodels and Transformation Rules: A Search-Based Approach

机译:元模型和转换规则的自动协同进化:基于搜索的方法

获取原文

摘要

Metamodels frequently change over time by adding new concepts or changing existing ones to keep track with the evolving problem domain they aim to capture. This evolution process impacts several depending artifacts such as model instances, constraints, as well as transformation rules. As a consequence, these artifacts have to be co-evolved to ensure their conformance with new metamodel versions. While several studies addressed the problem of metamodel/model co-evolution (Please note the potential name clash for the term co-evolution. In this paper, we refer to the problem of having to co-evolve different dependent artifacts in case one of them changes. We are not referring to the application or adaptation of co-evolutionary search algorithms.), the co-evolution of metamodels and transformation rules has been less studied. Currently, programmers have to manually change model transformations to make them consistent with the new metamodel versions which require the detection of which transformations to modify and how to properly change them. In this paper, we propose a novel search-based approach to recommend transformation rule changes to make transformations coherent with the new metamodel versions by finding a trade-off between maximizing the coverage of metamodel changes and minimizing the number of static errors in the transformation and the number of applied changes to the transformation. We implemented our approach for the ATLAS Transformation Language (ATL) and validated the proposed approach on four co-evolution case studies. We demonstrate the outperformance of our approach by comparing the quality of the automatically generated co-evolution solutions by NSGA-Ⅱ with manually revised transformations, one mono-objective algorithm, and random search.
机译:元模型经常通过添加新概念或更改现有概念来随时间而变化,以跟踪其旨在捕获的不断发展的问题领域。这种演变过程会影响一些依赖的工件,例如模型实例,约束和转换规则。结果,这些工件必须共同发展以确保它们与新的元模型版本一致。虽然一些研究解决了元模型/模型协同进化的问题(请注意,术语“协同进化”可能会引起名称冲突。在本文中,我们提到了在其中一种情况下必须协同进化不同的从属工件的问题)。我们不是在指协同进化搜索算法的应用或改进。)元模型和变换规则的协同进化研究较少。当前,程序员必须手动更改模型转换,以使其与新的元模型版本一致,新的元模型版本需要检测要修改的转换以及如何正确更改它们。在本文中,我们提出了一种新颖的基于搜索的方法,通过在最大化元模型更改的覆盖范围与最小化转换中的静态错误数量之间进行权衡取舍,从而推荐转换规则更改,以使转换与新的元模型版本保持一致。对转换应用的更改数。我们针对ATLAS转换语言(ATL)实施了我们的方法,并在四个协同进化案例研究中验证了所提出的方法。我们通过将NSGA-Ⅱ自动生成的协同进化解决方案的质量与手动修改的变换,一种单目标算法和随机搜索进行比较,证明了我们方法的优越性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号