Test execution comparisons
AssigneeEntit Sofware LLC
InventorsInbar Shani, Amichai Nitsan, Yaron Burg
Life of this patent
Estimating the term…
Abstract
Example implementations relate to test execution comparisons. Some implementations may include a data capture engine to capture data points during test executions of the application under test. The data points may include, for example, test action data and application action data. Additionally, some implementations may include a data correlation engine to correlate each of the data points with a particular test execution of the test executions, and each of the data points may be correlated based on a sequence of events that occurred during the particular test execution. Furthermore, some implementations may also automatically compare the test executions, based on the correlated data points, to identify commonalities.
Claims15
A system for test execution comparisons comprising;
- a data capture engine to capture data points during test executions of an application under test, the data points including test action data and application action data;
- a data correlation engine to correlate each of the data points with a particular test execution of the test executions, each of the data points being correlated based on a sequence of events that occurred during the particular test execution;
- and
- a test execution comparison engine to automatically compare the test executions, based on the correlated data points, to identify commonalities.
A non-transitory machine-readable storage medium including instructions which, when executed by a processor, cause the processor to:
- query a correlated data structure to obtain test execution information for each test execution in a set of test executions, the test execution information including information related to a set of data nodes connected to a set of backbone nodes in a directed acyclic graph;
- generate a string representation of the directed acyclic graph for each of the set of test executions;
- identify a longest common subsequence of the string representation for each of the set of test executions;
- and
- generate a visualization that identifies the longest common subsequence in each of the directed acyclic graphs.
12, The non-transitory machine-readable storage medium of claim 9, wherein generating the visualization comprises:
- displaying a subset of the set of backbone nodes that correspond with the longest common subsequence;
- and
- displaying, between nodes within the subset, information related to data nodes in the set of data nodes that are not within the subset.
A computer-implemented method comprising:
- accessing string representations of each of a set of directed acyclic graphs, the directed acyclic graphs Including a set of backbone nodes corresponding to test steps performed during historical test executions of an application under test and the set of data nodes corresponding to application actions performed in response to the test steps;
- identifying a longest common subsequence of the string representations;
- determining a level of similarity between each of the set of directed acyclic graphs based on a comparison between a length of a corresponding string representation of the string representations and a length of the longest common subsequence;
- and
- causing the display of a visualization of a subset of directed acyclic graphs in the set of directed acyclic graphs based on the level of similarity and the longest common subsequence.
Dependencies are inferred from the claim text.