| Constraint—Preserving Architecture Transformations：A Graph Rewriting Approach |
| |
| 引用本文： | 袁春,陈意云.Constraint—Preserving Architecture Transformations：A Graph Rewriting Approach[J].计算机科学技术学报,2001,16(6):590-594. |
| |
| 作者姓名： | 袁春 陈意云 |
| |
| 作者单位： | [1]DepartmentofComputerScienceandTechnology,UniversityofScienceandTechnologyofChinaHefei230027,P.R.China [2]DepartmentofComputerScienceandTechnology,UniversityofScienceandTechnologyo |
| |
| 基金项目： | This work was supported by the National Natural Science Foundation of China (No.69773025) and Ph.D. Foundation
of the Ministry |
| |
| 摘 要： | Architecture transformations are frequently performed during software design and maintenance.However this activity is not well supported at a sufficiently abstract level.In this paper,the authors characterize architecture transformations using using graph rewriting rules,where architectures are represented in graph notations,Architectures are usually required to satisfy certain constraints during evolution.Therefore a way is presented to construct the sufficient and necessary condition for a transformatio to preserve a constraint.The condition can be verified before the application of the transformation.Validated transformations are guaranteed not to violate corresponding constraints whenever applied.
|
| 关 键 词： | 软件工程 图形再生法 结构变换 |
Constraint-preserving architecture transformations: A graph rewriting approach |
| |
| Chun Yuan,Yiun Chen.Constraint-preserving architecture transformations: A graph rewriting approach[J].Journal of Computer Science and Technology,2001,16(6):590-594. |
| |
| Authors: | Chun Yuan Yiun Chen |
| |
| Affiliation: | (1) Department of Computer Science and Technology, University of Science and Technology of China, 230027 Hefei, P.R. China |
| |
| Abstract: | Architecture transformations are frequently performed during software design and maiatenance. However this activity is not well supported at a sufficiently abstract level. In this paper, the authors characterize architecture transformations using graph rewriting rules, where architectures are represented in graph notations. Architectures are usually required to satisfy certain constraints during evolution. Therefore a way is presented to construct the suffi- cient and necessary condition for a transformation to preserve a constraint. The condition can be verified before the application of the transformation. Validated transformations are guaranteed not to violate corresponding constraints whenever applied. |
| |
| Keywords: | architecture transformation graph rewriting weakest precondition constraint checking |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
