首页> 外文会议>International conference on model driven engineering languages and systems >Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples
【24h】

Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples

机译:在示例和反示例中自动搜索元模型格式规则

获取原文

摘要

Current metamodeling formalisms support the definition of a metamodel with two views: classes and relations, that form the core of the metamodel, and well-formedness rules, that constraints the set of valid models. While a safe application of automatic operations on models requires a precise definition of the domain using the two views, most metamodels currently present in repositories have only the first one part. In this paper, we propose to start from valid and invalid model examples in order to automatically retrieve well-formedness rules in OCL using Genetic Programming. The approach is evaluated on metamodels for state machines and features diagrams. The experiments aim at demonstrating the feasibility of the approach and at illustrating some important design decisions that must be considered when using this technique.
机译:当前的元模型形式主义通过以下两种观点支持对元模型的定义:类和关系(它们构成元模型的核心)和格式良好的规则(约束有效模型的集合)。安全地对模型进行自动操作需要使用两个视图对域进行精确定义,但是当前存储库中存在的大多数元模型只有第一部分。在本文中,我们建议从有效和无效的模型示例开始,以便使用遗传编程在OCL中自动检索格式正确的规则。该方法在状态机和功能图的元模型上进行了评估。实验旨在证明该方法的可行性,并说明使用该技术时必须考虑的一些重要设计决策。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号