A Coverage and Slicing Dependencies Analysis for Seeking Software Security Defects

Algorithm 2

Traversal algorithm: traverse (var).

Input: the execution path (given in the form of program code fragment)

Output: program slicing (the set 𝑠, 𝑘 number of element)

Symbol indicates:

Left: Each code line of the left chain

Right: Each code line of the right chain

Strore[𝑛]: Storage table

Var: Specified variable

L_pointer: Left temporary pointer variables

R_pointer: Right temporary pointer variables

Initialization: 𝑆←Φ

(1) {Repeat 𝑛=𝑛−1

(2) Left = store[𝑛] -> left

(3) Right = store[𝑛] -> right

(4) line_num = 𝑛

(5) L_pointer = left

(6) {Repeat: L_pointer = L_pointer -> next

(7)  If (L_pointer -> name) == var

(8)   go to 13

(9) Until L_pointer == null}

(10) go to 1

(11) Until (L_pointer -> name) == var}

(12) Add line_num to 𝑆 //code line numbers added to 𝑆 set

(13) R_pointer = right

(14) {Repeat R_pointer = R_pointer -> next

(15) var = R_pointer -> name

(16) traverse (var)  // Recursive traversal algorithm

(17) Until R_pointer == null}// Find next to the variable field is null

(18) {Repeat 𝑡_𝑖∈𝑆 //Simplified repeat statements in collection

(19) 𝑗=𝑖+1

(20) {Repeat 𝑡_𝑗∈𝑆

(21)  if 𝑡_𝑗=𝑡_𝑖

(22)   delete 𝑡_𝑗

(23) Until 𝑗=𝑘}

(24) Until 𝑖=𝑘}