# US 2023/0418730 A1 · Test case generator using automation library of an information handling system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2023/0418730 A1
- Document ID: US20230418730A1
- Status: Published application
- Kind: A1
- Application number: 17/808,204
- Filed: 2022-06-22
- Published: 2023-12-28
- Earliest claimed: 2022-06-22
- Assignees: Dell Products L.P.
- Applicants: Dell Products L.P.
- Inventors: Suren Kumar; Thanuja C
- Web page: https://patentgrep.com/patent/US20230418730A1

## CPC

- G06F 11/3684: {for test design, e.g. generating new test cases}
- G06F 11/3688: {for test execution, e.g. scheduling of test suites}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Code files for performing test cases on information handling systems may be generated from pre-existing test cases using natural language processing and/or machine learning algorithms. For example, a method may include receiving a test case comprising a plurality of tasks; identifying, by inputting the test case into a machine learning algorithm, a subset of code segments from code segments of at least one pre-existing test case in a code library matching at least one task of the plurality of tasks in the test case; and generating an indication of the subset of code segments for re-use from the at least one pre-existing test case for the test case.

## Claims

### Claim 1

A method, comprising:
receiving, by an information handling system, a test case comprising a plurality of tasks;
identifying, by the information handling system by inputting the test case into a machine learning algorithm, a subset of code segments from code segments of at least one pre-existing test case in a code library matching at least one task of the plurality of tasks in the test case; and
generating, by the information handling system, an indication of the subset of code segments for re-use from the at least one pre-existing test case for the test case.

### Claim 2 (depends on 1)

The method of claim 1, further comprising generating a report comprising a first indication of a first portion of the plurality of tasks not matching any of the at least one pre-existing test case, a second indicator of a second portion of the plurality of tasks partially matching a first portion of the plurality of tasks, and a third indicator of a third portion of the plurality of tasks matching a second portion of the plurality of tasks.

### Claim 3 (depends on 1)

The method of claim 1, further comprising determining at least one tag corresponding to each of the code segments, wherein identifying the subset of code segments matching at least one task is based on comparing the at least one tag of each of the code segments with at least one task.

### Claim 4 (depends on 3)

The method of claim 3, wherein determining the at least one tag corresponding to each of the code segments comprises analyzing the code segments using a latent Dirichlet allocation (LDA) algorithm.

### Claim 5 (depends on 3)

The method of claim 3, wherein determining the at least one tag corresponding to each of the code segments comprises analyzing the code segments using topic modeling.

### Claim 6 (depends on 1)

The method of claim 1, further comprising determining a code file for performing the test case, the code file comprising: a first portion corresponding to a first subset of tasks of the plurality of tasks for completion by a user; and a second portion corresponding to a second subset of tasks of the plurality of tasks comprising at least one code segment of the subset of code segments from the code library.

### Claim 7 (depends on 6)

The method of claim 6, further comprising determining at least one modified code segment based on at least one code segment of the subset of code segments for re-use for performing a corresponding task of the plurality of tasks of the test case, wherein the code file further comprises a third portion corresponding to a second subset of tasks of the plurality of tasks comprising the at least one modified code segment.

### Claim 8

An information handling system, comprising:
a memory;
a processor coupled to the memory, wherein the processor is configured to perform steps comprising:
receiving, by an information handling system, a test case comprising a plurality of tasks;
identifying, by the information handling system by inputting the test case into a machine learning algorithm, a subset of code segments from code segments of at least one pre-existing test case in a code library matching at least one task of the plurality of tasks in the test case; and
generating, by the information handling system, an indication of the subset of code segments for re-use from the at least one pre-existing test case for the test case.

### Claim 9 (depends on 8)

The information handling system of claim 8, wherein the processor is further configured to perform operations including generating a report comprising a first indicator of a first portion of the plurality of tasks not matching any of the at least one pre-existing test case, a second indicator of a second portion of the plurality of tasks partially matching a first portion of the plurality of tasks, and a third indicator of a third portion of the plurality of tasks matching a second portion of the plurality of tasks.

### Claim 10 (depends on 8)

The information handling system of claim 8, wherein the processor is further configured to perform operations including determining at least one tag corresponding to each of the code segments, wherein identifying the subset of code segments matching at least one task is based on comparing the at least one tag of each of the code segments with at least one task.

### Claim 11 (depends on 10)

The information handling system of claim 10, wherein determining the at least one tag comprises analyzing the code segments using a latent Dirichlet allocation algorithm.

### Claim 12 (depends on 8)

The information handling system of claim 8, wherein the processor is further configured to perform operations including determining a code file for performing the test case, the code file comprising: a first portion corresponding to a first subset of tasks of the plurality of tasks for completion by a user; and a second portion corresponding to a second subset of tasks of the plurality of tasks comprising at least one code segment of the subset of code segments from the code library.

### Claim 13 (depends on 12)

The information handling system of claim 12, wherein the processor is further configured to perform operations including determining at least one modified code segment based on at least one code segment of the subset of code segments for re-use for performing a corresponding task of the plurality of tasks of the test case, wherein the code file further comprises a third portion corresponding to a second subset of tasks of the plurality of tasks comprising the at least one modified code segment.

### Claim 14

A computer program product, comprising:
a non-transitory computer readable medium comprising code for performing steps comprising:
receiving, by an information handling system, a test case comprising a plurality of tasks;
identifying, by the information handling system by inputting the test case into a machine learning algorithm, a subset of code segments from code segments of at least one pre-existing test case in a code library matching at least one task of the plurality of tasks in the test case; and
generating, by the information handling system, an indication of the subset of code segments for re-use from the at least one pre-existing test case for the test case.

### Claim 15 (depends on 14)

The computer program product of claim 14, wherein the medium further comprises code for performing operations including generating a report comprising a first indicator of a first portion of the plurality of tasks not matching any of the at least one pre-existing test case, a second indicator of a second portion of the plurality of tasks partially matching a first portion of the plurality of tasks, and a third indicator of a third portion of the plurality of tasks matching a second portion of the plurality of tasks.

### Claim 16 (depends on 14)

The computer program product of claim 14, wherein the medium further comprises code for performing operations including determining at least one tag corresponding to each of the code segments, wherein identifying the subset of code segments matching at least one task is based on comparing the at least one tag of each of the code segments with at least one task.

### Claim 17 (depends on 16)

The computer program product of claim 16, wherein determining the at least one tag comprises analyzing the code segments using a latent Dirichlet allocation algorithm.

### Claim 18 (depends on 16)

The computer program product of claim 16, wherein determining the at least one tag corresponding to each of the code segments comprises analyzing the code segments using topic modeling.

### Claim 19 (depends on 14)

The computer program product of claim 14, wherein the medium further comprises code for performing operations including determining a code file for performing the test case, the code file comprising: a first portion corresponding to a first subset of tasks of the plurality of tasks for completion by a user; and a second portion corresponding to a second subset of tasks of the plurality of tasks comprising at least one code segment of the subset of code segments from the code library.

### Claim 20 (depends on 19)

The computer program product of claim 19, wherein the medium further comprises code for performing operations including determining at least one modified code segment based on at least one code segment of the subset of code segments for re-use for performing a corresponding task of the plurality of tasks of the test case, wherein the code file further comprises a third portion corresponding to a second subset of tasks of the plurality of tasks comprising the at least one modified code segment.
