| 基于语法树的程序正确性验证模型及算法设计 |
| |
| 引用本文： | 周必水,张延红,赵敬. 基于语法树的程序正确性验证模型及算法设计[J]. 杭州电子科技大学学报, 2006, 26(1): 1-4 |
| |
| 作者姓名： | 周必水 张延红 赵敬 |
| |
| 作者单位： | 1. 杭州电子科技大学计算机学院,浙江,杭州,310018
2. 中国电子科技集团二十二所,山东,青岛,266071 |
| |
| 摘 要： | 基于语法树的程序正确性验证方法是目前程序正确性验证全新的研究领域,该方法以程序的语法树作为程序正确性的检验对象,运用适当的树匹配算法,来验证目标程序的正确性.该文在介绍基于语法树的程序正确性验证方法的基础上,借鉴无序标签树匹配的相关研究成果,结合软件构件的查询技术,提出一种新的XML路径查询模型和树匹配算法,并展示了STM在程序正确性验证方面的前景.
|
| 关 键 词： | 程序正确性验证 树匹配 路径查询 匹配度 |
| 文章编号： | 1001-9146（2006）01-0001-04 |
| 收稿时间： | 2005-09-05 |
| 修稿时间： | 2005-09-05 |
Model and Algorithm Designing of the Proof of Program Correctness Based on XML Syntax Trees |
| |
| ZHOU Bi-shui,ZHANG Yan-hong,ZHAO Jing. Model and Algorithm Designing of the Proof of Program Correctness Based on XML Syntax Trees[J]. Journal of Hangzhou Dianzi University, 2006, 26(1): 1-4 |
| |
| Authors: | ZHOU Bi-shui ZHANG Yan-hong ZHAO Jing |
| |
| Affiliation: | 1. School of Computer Scienle, Hangzhou Dianzi Urdversity, Hangzhou Zhejiang 310018, China; 2. Zhorgguo Dianzi Kefi Jituan Ershiersuo , Shargdong Qirgdao 266071, China |
| |
| Abstract: | The method of the proof of program correctness based on syntax trees is the fire - new research field. In this method, the program syntax trees is the checked object in proof procedure of program correctness, the property tree matching algorithm is adopted to proof the correctness target program.This article bases on the foundation of introduction of STM, uses the research result of unordered tree - inclusion matching, integrates the technology in software component query, proposes a new model of path query and tree matching algorithm, shows the prospect of STM in the last. |
| |
| Keywords: | proof of program correctness XML tree matching path query xpath matching degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
