ISSN 1000-1239 CN 11-1777/TP

• 软件技术 •

### 元数据存储库系统中违背良格式约束潜在操作的推理

1. 1(天津工业大学计算机科学与软件学院 天津 300387); 2(计算机软件新技术国家重点实验室(南京大学) 南京 210023); 3(中国科学院智能信息处理重点实验室(中国科学院计算技术研究所) 北京 100190) (zhaoxiaofei1978@hotmail.com)
• 出版日期: 2016-05-01
• 基金资助:
国家自然科学基金项目(61035003,61072085,51378350)；国家“九七三”重点基础研究发展计划基金项目(2013CB329502)；计算机软件新技术国家重点实验室(南京大学)开放课题项目(KFKT2014B16)；天津市科技特派员项目(15JCTPJC58100)

### Reasoning on Constraints for Incoherent Operations in Metadata Repository Systems

Zhao Xiaofei1,2,3, Gao Yang2, Shi Yinghuan2, Shi Zhongzhi3

1. 1(School of Computer Science and Software Engineering, Tianjin Polytechnic University, Tianjin 300387); 2(State Key Laboratory for Novel Software Technology (Nanjing University), Nanjing 210023); 3(Key Laboratory of Intelligent Information Processing, Chinese Academy of Sciences (Institute of Computing Technology, Chinese Academy of Sciences), Beijing 100190)
• Online: 2016-05-01

Abstract: The architecture of the repository system metadata is hierarchical, multi-layer, dynamically changed and complicated; the prevailing repository system specifications provide insufficiently support for validating well-formedness constraints, so how to check well-formedness constraints for MOF (meta object facility) metadata repository systems becomes a difficult problem. This paper presents an approach which can reasoning on the well-formedness constraints in the different layers, thus the operations that may violate the constraints can be determined automatically. Firstly, a group of inner activities which are more accurate and adaptable than establishment activities provided by MOF are proposed. We define the correspondence between inner activities and establishment activities. Then we research how to reasoning on the constraints directly so that the incoherent inner activities can be detected. At last, we research how to deduce potentially incoherent operations by determining the establishment activities that potentially violate the constraints and testing whether these activities are included in the operations. Our approach can improve the efficiency of well-formedness constraint checking because the precise set of constraints that will be violated by operations can be reduced in the actual checking process. In addition, our method also helps to the constraint design process since we can discard the constraint if we find it can never be violated by any operations.