Specification and Verification for Semi-Structured Data  

作　　者：CHEN Tao-lue HAN Ting-ting LU Jian 

机构地区：[1]State Key Laboratory of Novel Software Technology,Nanjing University, Nanjing 210093, Jiangsu, China

出　　处：《Wuhan University Journal of Natural Sciences》2006年第1期107-112,共6页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Sciences Foun-dation of China (60233010 ,60273034 ,60403014) ,863 ProgramofChina (2002AA116010) ,973 Programof China (2002CB312002)

摘　　要：Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems, In this paper, we introduce recursion into such logic system, which can describe the tree data more dearly and concisely. By making a distinction between proposition and predicate, a concise semantics interpretation for our modal logic is given. We also develop a model checking algorithm for the logic without △ operator. The correctness of the algorithm is shown. Such work can be seen as the basis of the semi-structured data processing language and more flexible type system.Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems, In this paper, we introduce recursion into such logic system, which can describe the tree data more dearly and concisely. By making a distinction between proposition and predicate, a concise semantics interpretation for our modal logic is given. We also develop a model checking algorithm for the logic without △ operator. The correctness of the algorithm is shown. Such work can be seen as the basis of the semi-structured data processing language and more flexible type system.

关 键 词：semi structured data tree logic FIXPOINT model checking algorithm 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]