Process flow optimized directed graph traversal
View Patent ↗Embodiments disclosed herein relate to a process flow optimized directed graph traversal. In one embodiment, a processor performs a depth first traversal of the optimized directed graph where a node from a first node is not traversed until the nodes before the first node are traversed. The processor may output information associated with the nodes based on the traversal.
1. A method, comprising:
analyzing, by a processor, an optimized directed graph of nodes representing a process flow, wherein the optimized directed graph comprises a first sub-graph and a second sub-graph, the first sub-graph being rooted at a first node and ending at a second node and comprising at least two predecessor nodes pointing at the second node, and the second sub-graph being rooted at the second node;
performing, by the processor, a depth first traversal of all nodes of the first sub-graph starting at the first node and ending at the second node;
after the depth first traversal of all nodes of the first sub-graph, performing, by the processor, a depth first traversal of all nodes of the second sub-graph starting from the second node; and
outputting, by the processor, text associated with a linear form of the process flow based on the depth first traversals, wherein the outputting comprises at least one of displaying the text and storing the text.
2. The method of claim 1 , wherein the optimized directed graph comprises a control flow directed graph of compiled software code.
3. The method of claim 2 , further comprising evaluating the output text for a security vulnerability.
4. The method of claim 2 , further comprising traversing a software code loop as a separate optimized directed graph.
5. The method of claim 1 , wherein outputting text comprises outputting conditional statements associated with the optimized directed graph based on the depth first traversals.
6. The method of claim 1 , wherein outputting text comprises combining two conditional statements where the nodes associated with the two conditional statements result in the same node in the directed graph.
7. An apparatus, comprising:
a machine-readable non-transitory storage medium comprising instructions to:
analyze an optimized directed graph of nodes representing a process flow, wherein the optimized directed graph comprises a first sub-graph and a second sub-graph, the first sub-graph being rooted at a first node and ending at a second node and comprising at least two predecessor nodes pointing at the second node, and the second sub-graph being rooted at the second node;
perform a first depth first traversal of all nodes of the first sub-graph starting at the first node and ending at the second node;
after the first depth first traversal, perform a second depth first search of all nodes in the second sub-graph starting from the second node; and
output information related to the process flow based on the traversal, wherein the instructions to output information comprise instructions to at least one of display the information and store the information; and
a processor to execute the instructions stored in the machine-readable non-transitory storage medium.
8. The apparatus of claim 7 , wherein instructions to output information comprise instructions to:
combine information from multiple nodes to create a conditional statement; and
output the conditional statement.
9. The apparatus of claim 7 , wherein the optimized directed graph comprises an optimized directed graph of compiled software source code.
10. The apparatus of claim 9 , wherein instructions to output information comprise instructions to output linear form of a software source code process flow.
11. The apparatus of claim 10 , wherein the machine-readable storage medium further comprises instructions to:
determine security information associated with the linear form of the software source code process flow; and
output the determined security information.
12. A machine-readable non-transitory storage medium comprising instructions executable by a processor to perform operations comprising:
reverse engineering an optimized directed graph of nodes representing a software source code process flow, wherein
the optimized directed graph comprises a first sub-graph and a second sub-graph, the first sub-graph being rooted at a first node and ending at a second node and comprising at least two predecessor nodes pointing at the second node, and the second sub-graph being rooted at the second node, and
the reverse engineering comprises performing a first depth first traversal of all nodes of the first sub-graph starting at the first node and ending at the second node and, after the first depth first traversal, performing a second depth first search of all nodes in the second sub-graph starting from the second node; and
outputting text associated with the optimized directed graph nodes based on the reverse engineering, wherein the text represents a linear form of the process flow, wherein the outputting comprises east one of displaying the text and storing the text.
13. The machine-readable non-transitory storage medium of claim 12 , further comprising instructions to analyze the output text for a security vulnerability.
14. The machine-readable non-transitory storage medium of claim 12 , further comprising instructions to combine text from two nodes into a single conditional statement where the two nodes result in the same node.
15. The machine-readable non-transitory storage medium of claim 12 , further comprising instructions to compile the linear form of the process flow.