Test execution comparisons

1. A system comprising:

a processor; and

a memory to store instructions that, when executed by the processor, cause the processor to:

capture first data points during a plurality of test executions of an application under test, the first data points including test action data and application action data;

correlate each first data point of the first data points with a particular test execution of the plurality of test executions to provide correlated data points, wherein the correlation comprises correlating the each first data point-based on a sequence of events that occurred during the particular test execution; and

automatically compare the plurality of test executions, based on the correlated data points, to identify commonalities, wherein the comparison comprises:

categorizing each correlated data point of the correlated data points into at least one type of a plurality of types to provide categorized data points, the at least one type including a first type;

assigning the correlated data points categorized as the first type as backbone nodes of a first directed acyclic graph; and

connecting remaining data points of the categorized data points as data nodes to the backbone nodes via directed edges based on timestamps associated with the remaining data points, the remaining data points being a set of the categorized data points not categorized as the first type.

2. The system of claim 1 , wherein the instructions, when executed by the processor, further cause the processor to assign metadata as vertices connected to the backbone nodes; and

assign tags to the directed edges to identify relations between the vertices.

3. The system of claim 1 , wherein the instructions, when executed by the processor, further cause the processor to generate a plurality of directed acyclic graphs for the plurality of test executions, wherein the first directed acyclic graph is part of the plurality of directed acyclic graphs, and each directed acyclic graph of the plurality of directed acyclic graphs includes a set of backbone nodes and a set of data nodes connected to the set of backbone nodes.

4. The system of claim 3 , wherein the instructions, when executed by the processor, further cause the processor to:

generate a plurality of string representations, wherein each string representation of the plurality of string representations corresponds to a-directed acyclic graph of the plurality of directed acyclic graphs;

identify a longest common subsequence of the plurality of string representations;

determine a level of similarity between the plurality of test executions based on the longest common subsequence; and

map the longest common subsequence back to a subset of backbone nodes in the sets of backbone nodes.

5. The system of claim 4 , wherein the instructions, when executed by processor, further causes the processor to:

generate a set of string representations of the plurality of string representations for each set of backbone nodes of the sets of backbone nodes; and

concatenate the sets of string representations based on orders of the sets of backbone nodes.

6. The system of claim 4 , wherein the instructions, when executed by the processor, further cause the processor to

calculate a similarity value based on a comparison of a length of the longest common subsequence to a length of each string representation of the plurality of string representations; and

compare the similarity value to a threshold value to determine the level of similarity.

7. The system of claim 4 , wherein the instructions, when executed by the processor, further cause the processor to generate data to cause a visualization of the plurality of test executions, wherein the generation of the data comprises:

providing data to cause a listing of, for each directed acyclic graph of the plurality of directed acyclic graphs, a sequence of the set of backbone nodes of the each directed acyclic graph;

providing data to cause a highlighting of, for each directed acyclic graph of the plurality of directed acyclic graphs, the subset of backbone nodes of the each directed acyclic graph to provide a highlighted subset of backbone nodes for the each directed acyclic graph; and

providing data to cause a visual alignment of a display of each directed acyclic graph of the plurality of directed acyclic graphs that correspond with the longest common subsequence.

8. The system of claim 7 , wherein providing the data to cause the visual alignment comprises:

collapsing nodes of the each directed acyclic graph that corresponds with the longest common subsequence and are not in the highlighted subset of backbone nodes of the each directed acyclic graph that corresponds with the longest common subsequence to provide collapsed nodes; and

providing data to display summary information for the collapsed nodes.

9. A non-transitory machine-readable storage medium including instructions which, when executed by a processor, cause the processor to:

access data representing first data points captured during a plurality of test executions of an application under test, wherein the first data points include test action data and application action data;

correlate each first data point of the first data points with a particular test execution of the plurality of test executions to provide correlated data points, wherein the correlation comprises correlating the each first data point based on a sequence of events that occurred during the particular test execution;

compare the plurality of test executions, based on the correlated data points, to identify commonalities, wherein the comparison comprises:

categorizing each correlated data point of the correlated data points into at least one type of a plurality of types to provide categorized data points, the at least one type including a first type;

assigning the correlated data points categorized as the first type as backbone nodes of a first directed acyclic graph; and

connecting remaining data points of the categorized data points as data nodes to the backbone nodes via directed edges based on timestamps associated with the remaining data points, the remaining data points being a set of the categorized data points not categorized as the first type; and

generate data to provide a visualization of the first directed acyclic graph.

10. The non-transitory machine-readable storage medium of claim 9 , wherein the backbone nodes correspond to user actions performed during historical test executions of the application under test, and the data nodes correspond to application actions performed in response to the user actions.

11. The non-transitory machine-readable storage medium of claim 9 , wherein the instructions, when executed by the processor, further cause the processor to generate a string representation of the first directed acyclic graph based on a data node type and data node attributes.

12. The non-transitory machine-readable storage medium of claim 9 , wherein the instructions, when executed by the processor, further cause the processor to:

assign metadata as vertices connected to the backbone nodes; and

assign tags to the directed edges to identify relations between the vertices.

13. A computer-implemented method comprising:

accessing data representing first data points captured during a plurality of test executions of an application under test, wherein the first data points include test action data and application action data;

correlate each first data point of the first data points with a particular test execution of the plurality of test executions to provide correlated data points, wherein the correlation comprises correlating the each first data point based on a sequence of events that occurred during the particular test execution;

comparing the plurality of test executions, based on the correlated data points, to identify commonalities, wherein the comparison comprises:

categorizing each correlated data point of the correlated data points into at least one type of a plurality of types to provide categorized data points, the at least one type including a first type;

assigning the correlated data points categorized as the first type as backbone nodes of a first directed acyclic graph; and

connecting remaining data points of the categorized data points as data nodes to the backbone nodes via directed edges based on timestamps associated with the remaining data points, the remaining data points being a set of the categorized data points not categorized as the first type; and

generating data to provide a visualization of the first directed acyclic graph.

14. The computer-implemented method of claim 13 , further comprising generating a plurality of directed acyclic graphs for the plurality of test executions, wherein the first directed acyclic graph is part of the plurality of directed acyclic graphs, and each directed acyclic graph of the plurality of directed acyclic graphs includes a set of backbone nodes and a set of data nodes connected to the set of backbone nodes.

15. The computer-implemented method of claim 14 , further comprising:

generating a plurality of string representations, wherein each string representation of the plurality of string representations corresponds to a directed acyclic graph of the plurality of directed acyclic graphs;

identifying a longest common subsequence of the plurality of string representations;

determining a level of similarity between the plurality of test executions based on the longest common subsequence; and

mapping the longest common subsequence back to a subset of backbone nodes in the sets of backbone nodes.