Research Article
A New Method to Analyze the Security of Protocol Implementations Based on Ideal Trace
Algorithm 1
The protocol source code refinement algorithm (written in C pseudocode).
Step 1. IniStack(); // initiate a stack. Here, represents stack. | Step 2. Input file.; // input a file (protocol source codes) | Step 3. While (judge whether the file of protocol source codes is finished) | (judge whether functions are true) Push(); functions push into the | stack. Here, represents file. . | Continue to seek the functions of protocol source codes. | āāwhile | Step 4. While ( StackEmpty()) judge whether the stack is empty. | GetTop(); pop the functions which are on the top of the stack. | if (the top functions of the stack satisfy protocol specifications) the functions | can reflect the code execution of protocol interactive communication, such as | send and recv of socket API. | | Else | //while |
|