Figure 1.

Code segmentation"

Figure 2.

Code restore"

Figure 3.

Declaration in different packages"

Table 1.

Package generation algorithm"

Figure 4

shows that a change of packet permutation results in the interval of packet number m ∈ 1 , n and the second Stirling number composed of positive integer n and m with the increase of declaration number n. This method of using permutation and combination to construct the declaration as a package can be used to sort violently regardless of the clues in the program. The main cost of the algorithm is to make a full permutation of the declaration sort, so the problem can be solved in polynomial time. "

Figure 4.

Relationship between declaration, package and Stirling number"

Figure 5.

Directed acyclic graphs with two points"

Figure 6.

Three points constitute a directed acyclic graph"

Table 2.

Directed Acyclic Graph Create Algorithm"

Figure 7.

Trigeminal tree represents the relationship between two points"

Figure 8.

Code Obfuscation"

Figure 9.

Layout confusion"

Figure 10.

Expansion"

Figure 11.

Misleading leads to new results"

Table 3.

Pragram Overview"

Figure 12.

Declaration relation generated by dot language"

Table 4.

Impact of the increasing number of declaration on brute force cracking algorithms"

Figure 13.

Expansion of proliferation on cues"

Figure 14.

Influence of layout confusion and data confusion on test results"

Table 5.

Influence of different confusion methods on testing"