Method and system for generating and processing black box test cases

A system for generating and processing one or more test cases for effective black box testing of software applications, the system comprising:

• at least one or more processors;
• an automatic test case generator in communication with the at least one or more processors and configured to automatically generate one or more test cases based on one or more parameters, wherein the one or more parameters are identified from one or more automated manual test cases associated with one or more business models, and further wherein the generated one or more automated test cases cover one or more paths in the one or more business models;
• a test case optimizer in communication with the at least one or more processors and configured to optimize the one or more automated test cases, wherein the one or more automated test cases are optimized by determining minimal path covered by the one or more automated test cases in the one or more business models based on analysis of the one or more paths covered by the one or more automated test cases in the one or more business models;
• and
• a code coverage data generator in communication with the at least one or more processors and configured to obtain code coverage data of the optimized test cases, the code coverage data being obtained by execution of the optimized test cases, wherein the code coverage data represents percentage of code of the software applications covered by the optimized test cases, and further wherein the optimized test cases are processed based on the code coverage data for black box testing;
• wherein optimizing the one or more automated test cases by determining minimal path covered by the one or more automated test cases in the one or more business models comprises:
• a. obtaining one or more unique paths covered by the one or more automated test cases in the one or more business models, wherein the one or more unique paths represent paths that cover one or more nodes in the one or more business models only once;
• b. storing the obtained unique paths in a first list in a repository;
• c. creating a matrix of a plurality of nodes of the one or more business models, wherein the matrix comprises one or more paths covered by the one or more automated test cases, and further wherein the one or more paths covered by the one or more automated test cases include the unique paths;
• d. identifying a path in the matrix with maximum number of uncovered nodes, wherein the path is identified by iterating over the one or more paths covered by the one or more automated test cases in the matrix;
• e. removing the identified path with maximum number of uncovered nodes from the first list of unique paths and storing the identified path in a second list in the repository;
• f. repeating step d until each of the plurality of nodes in the matrix are covered to identify one or more paths with maximum number of uncovered nodes in the matrix;
• and
• g. removing the identified one or more paths with maximum number of uncovered nodes from the first list of unique paths and storing the identified one or more paths in the second list in the repository, wherein the one or more paths stored in the second list represent paths that cover each of the plurality of nodes in the one or more business models at least once.

A computer program product comprising:

• a non-transitory computer-readable medium having computer-readable program code stored thereon, the computer-readable program code comprising instructions that, when executed by a processor, cause the processor to:
• automatically generate one or more test cases based on one or more parameters, wherein the one or more parameters are identified from one or more automated manual test cases associated with one or more business models, and further wherein the generated one or more automated test cases cover one or more paths in the one or more business models;
• optimize the one or more automated test cases, wherein the one or more automated test cases are optimized by determining minimal path covered by the one or more automated test cases in the one or more business models based on analysis of the one or more paths covered by the one or more automated test cases in the one or more business models;
• obtain code coverage data of the optimized test cases, the code coverage data being obtained by execution of the optimized test cases, wherein the code coverage data represents percentage of code of software applications covered by the optimized test cases;
• and
• analyze the optimized test cases for at least prioritization and further optimization of the optimized test cases based on the code coverage data and one or more predetermined conditions for black box testing;
• wherein optimizing the one or more automated test cases by determining minimal path covered by the one or more automated test cases in the one or more business models comprises:
• a. obtaining one or more unique paths covered by the one or more automated test cases in the one or more business models, wherein the one or more unique paths represent paths that cover one or more nodes in the one or more business models only once;
• b. storing the obtained unique paths in a first list in a repository;
• c. creating a matrix of a plurality of nodes of the one or more business models, wherein the matrix comprises one or more paths covered by the one or more automated test cases, and further wherein the one or more paths covered by the one or more automated test cases include the unique paths;
• d. identifying a path in the matrix with maximum number of uncovered nodes, wherein the path is identified by iterating over the one or more paths covered by the one or more automated test cases in the matrix;
• e. removing the identified path with maximum number of uncovered nodes from the first list of unique paths and storing the identified path in a second list in the repository;
• f. repeating step d until each of the plurality of nodes in the matrix are covered to identify one or more paths with maximum number of uncovered nodes in the matrix;
• and
• g. removing the identified one or more paths with maximum number of uncovered nodes from the first list of unique paths and storing the identified one or more paths in the second list in the repository, wherein the one or more paths stored in the second list represent paths that cover each of the plurality of nodes in the one or more business models at least once.