Translating OCL to Graph Patterns
Translating OCL to Graph Patterns
复制标题
将 OCL 转换为图形模式
DOI：
10.1007/978-3-319-11653-2_41
复制
发表时间：
2014
影响因子：
2
通讯作者：
Gábor Bergmann
中科院分区：
文献类型：
--
作者：
Gábor Bergmann
模型驱动工具将模型查询用于许多目的，包括格式良好性规则的验证和派生特征的规范。工业上可用的大多数声明性模型查询语料库似乎使用OCL语言。然而，由于其更抽象的规范，基于图模式的查询将具有许多优势，例如通过高级查询评估技术提高性能。由于查询性能可能是大型模型的一个关键问题，因此评估图形模式而不是OCL查询在实践中可能会很有用。
Model-driven tools use model queries for many purposes, including validation of well-formedness rules and specification of derived features. The majority of declarative model query corpus available in industry appears to use the OCL language. Graph pattern based queries, however, would have a number of advantages due to their more abstract specification, such as performance improvements through advanced query evaluation techniques. As query performance can be a key issue with large models, evaluating graph patterns instead of OCL queries could be useful in practice.