Program correctness verification method based on syntax tree
A syntax tree and program technology, applied in the field of program design correctness verification, can solve problems such as insufficient efficiency and accuracy, and achieve the effect of easy verification
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0020] 1 method involves relevant definitions and descriptions:
[0021] Definition 1 (mapping) Let T1=(V, E, root(T1)), T2=(W, F, root(T2)) be two label trees, and a mapping M from T1 to T2 is defined as M ⊆ V × W , And for all (v1, w1), (v2, w2) ∈ M satisfy the following conditions:
[0022] 1) v 1 = v 2 ⇔ w 1 = w 2 , Indicates that the nodes participating in the mapping in the two trees are in one-to-one correspondence;
[0023] 2) v 1 = ancestor ( v 2 ) ⇔ w 1 = ancestor ( w 2 ) , The representation map maintains the ancestor-descendant relatio...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 