期刊文献+

基于语法树的程序正确性验证模型及算法设计 被引量:2

Model and Algorithm Designing of the Proof of Program Correctness Based on XML Syntax Trees
在线阅读 下载PDF
导出
摘要 基于语法树的程序正确性验证方法是目前程序正确性验证全新的研究领域,该方法以程序的语法树作为程序正确性的检验对象,运用适当的树匹配算法,来验证目标程序的正确性。该文在介绍基于语法树的程序正确性验证方法的基础上,借鉴无序标签树匹配的相关研究成果,结合软件构件的查询技术,提出一种新的XML路径查询模型和树匹配算法,并展示了STM在程序正确性验证方面的前景。 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.
出处 《杭州电子科技大学学报(自然科学版)》 2006年第1期1-4,共4页 Journal of Hangzhou Dianzi University:Natural Sciences
基金 省教育厅基金项目(KYH063103004)
关键词 程序正确性验证 树匹配 路径查询 匹配度 proof of program correctness XML tree matching path query xpath matching degree
  • 相关文献

参考文献4

二级参考文献32

  • 1H D Ebbinghaus, J Flum. Finite Model Theory. Berlin: SpringerVerlag, 1995.
  • 2Victor Vianu. A web odyssey: From codd to XML.In:PODS2001. Santa Barbara, CA: ACM Press, 2001. 1-15.
  • 3John E Hopcroft, Jeffrey D Ullman. Introduction to Automata Theory, Languages, and Computation, 2nd edition. Addison-Wesley, 2000.
  • 4Ivar J. Software reuse: Architecture, process and organization for business success. Reading: Addison-Wesley Publishing Company,1997.4~15.
  • 5Mill H, Mili A. Reuse based software engineering. New York: John Wiley & Sons Inc., 2002. 444-459.
  • 6Frakes WB, Pole TP. An empirical study of representation methods for reusable software components. IEEE Transactions on Software Engineering, 1994,120(8):617~630.
  • 7Gibb F, McCartan C, O'Donnell R, Sweeney N, Leon R. The integration of information retrieval techniques within a software reuse environment. Journal of Information Science, 2000,26(4):520--539.
  • 8Torshen S. ApproXQL: Design and implementation of an approximate pattern matching language for XML. Technical Report, B 01-02, Freie University at Berlin, 2001.
  • 9Thorsten R. A new measure of the distance between ordered trees and its applications. Research Report, 85166, Department of Computer Science, University of Bonn, 1997.
  • 10Torshen S, Naumann F. Approximate tree embedding for querying XML data. In: Proceedings of ACM SIGIR Workshop on XML and Information Retrieval. Athens, 2000.

共引文献64

同被引文献14

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部