 |
|
|
|
 |
 |
 |
|
 |
|
 |
|
|
| 刘辉,麻志毅,邵维忠.模型转换中特性保持的描述与验证.软件学报,2007,18(10):2369-2379 |
| 模型转换中特性保持的描述与验证 |
| Description and Proof of Property Preservation of Model Transformations |
| 投稿时间：2006-09-07 修订日期：2006-09-07 |
| DOI： |
| 中文关键词: 模型转换 特性保持 行为保持 重构 演化 MDA(model driven architecture) |
| 英文关键词:model transformation property preservation behavior-preservation refactoring evolution MDA (model driven architecture) |
| 基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.60473064, 60773152 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant No.2007AA01Z127 (国家高技术研究发展计划(863)); the National Basic Research Program of China under Grant No.2005CB321805 (国家重点基础研究发展计划(973)); the Key Technologies R&D Program of China under Grant No.2003BA904B02 (国家科技攻关计划) |
| 作者 | 单位 | | 刘辉 | 北京大学,信息科学技术学院,软件研究所,北京,100871
高可信软件技术教育部重点实验室(北京大学),北京,100871 | | 麻志毅 | 北京大学,信息科学技术学院,软件研究所,北京,100871
高可信软件技术教育部重点实验室(北京大学),北京,100871 | | 邵维忠 | 北京大学,信息科学技术学院,软件研究所,北京,100871
高可信软件技术教育部重点实验室(北京大学),北京,100871 |
|
| 摘要点击次数: 3437 |
| 全文下载次数: 3412 |
| 中文摘要: |
| 模型转换主要用于模型的演化、求精以及重构.模型转换需要遵循一定的约束规则以保持模型的某些特性.模型演化通常要求保持已有的接口;模型重构则必须保证重构前后的软件具有相同的外部行为特性.为了严格证明某个模型转换规则是否满足这些约束,特性保持约束必须形式化地加以描述.为了实现证明过程的自动化,需要总结通用的证明过程并给出实现算法.提出了一种基于图转换的特性保持约束描述机制,将模型演化与重构中的转换规则以及特性保持约束都描述为图转换规则.借助图转换的冲突检测机制,给出了严格证明转换规则是否满足特性保持约束的算法. |
| 英文摘要: |
| Model transformations are heavily used in model evolution,refinement and refactorings. Model transformations are carried out against certain constraints to preserve certain properties of the models. During model evolution,model transformations should preserve system interfaces; during model refactoring,model transformations should preserve system behaviors. In order to prove that a software transformation satisfies transformation constraints,constraints should be formalized first. And in order to automate the proof,the process of the proof should be universal to be supported by algorithms. This paper proposes an approach for formalizing transformation constraints with graph productions. With the formalized constraints and software transformation rules,an algorithm is also proposed based on critical pair analyzing technologies to automatically prove whether a transformation rule satisfies a transformation constraint or not. The proposed approach is validated with a motivating example used throughout the paper. |
|
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |
|
|
|
|
|
|
 |
|
|
|
|
 |
|
 |
|
 |
|
