Model and Algorithm Designing of the Proof of Program Correctness Based on XML Syntax Trees
Zhou Bi-shui · Journal of Hangzhou Dianzi University · 2006
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.