Test case generation for path coverage. (c2000)

2000 ◽  
Author(s):  
Miran Salame
Keyword(s):  
Test Case Generation ◽  
Test Case ◽  
Path Coverage

A Analysis and Research on the Methods of Object Oriented Software Testing

2013 ◽  
Vol 709 ◽  
pp. 616-619
Author(s):  
Jing Chen
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Test Data ◽  
Object Oriented ◽  
Automatic Generation ◽  
Test Case Generation ◽  
Test Case ◽  
Test Cases ◽  
Path Coverage ◽  
Parameter Values

This paper proposes a genetic algorithm-based method to generate test cases. This method provides information for test case generation using state machine diagrams. Its feature is realizing automation through fewer generated test cases. In terms of automatic generation of test data based on path coverage, the goal is to build a function that can excellently assess the generated test data and guide the genetic algorithms to find the targeting parameter values.

scholarly journals Test Case Generation for UML Behavioral Diagram by Traversal Algorithm

2019 ◽  
Vol 8 (10) ◽  
pp. 3262-3266
Keyword(s):  
Accurate Result ◽  
Test Case Generation ◽  
Test Case ◽  
Test Cases ◽  
Sequence Diagrams ◽  
Research Focus ◽  
Activity Diagram ◽  
Path Coverage ◽  
The Comparative Study ◽  
Traversal Algorithm

Software testing play crucial role in the software development as it consumes lot of time and resources. However testing process needs to be more efficiently done because overall software quality relies upon good testing approach. The present research focus on generation of test cases from UML diagrams. The combination graph is made by using activity and sequence diagrams. These diagrams proves to be more efficient as activity diagram gives the dynamic behavior of the model and sequence diagram is used to understand detailed functionality of the system. In this paper, a combined approach using Breadth first and depth first search is proposed which will generate expected test cases. The comparative study is done for test case generation using BFS and DFS algorithm and the result proves that the DFS traversal algorithm provides more accurate result for path coverage.

scholarly journals Forest Optimization based Test Case Generation for Multiple Paths with Metamorphic Relations

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0
Keyword(s):  
Efficient Method ◽  
Optimization Algorithm ◽  
Test Case Generation ◽  
Test Case ◽  
Test Cases ◽  
Initial Test ◽  
Time Consumption ◽  
Path Coverage ◽  
Multiple Paths ◽  
Metaheuristic Techniques

In general multiple paths are covered by multiple runs which is a time consuming task. Now a days, metaheuristic techniques are widely used for path coverage. In order to reduce the time, an efficient method is proposed based on Forest Optimization Algorithm (FOA) with Metamorphic Relations (MRs) that cover multiple paths at a time in one run unlike the traditional search based testing. In the proposed approach, initial test case is generated using FOA, the successive test cases are generated using MRs without undergoing several runs. The motive of using FOA is that the searching mechanism of this algorithm having resemblance with the branch / path coverage techniques of testing. To the best of our knowledge, FOA has not been implemented in software testing. The experimental results are compared with three existing work. The efficiency of simply FOA is also shown how it able to cover multiple paths. The results show that FOA with MRs is more efficient in terms of time consumption and number of paths covered.

An Ontology-Based Approach to Automated Test Case Generation

2021 ◽  
Vol 2 (1) ◽  
Author(s):  
Shreya Banerjee ◽  
Narayan C. Debnath ◽  
Anirban Sarkar
Keyword(s):  
Test Case Generation ◽  
Test Case ◽  
Automated Test Case Generation ◽  
Automated Test
Sign in / Sign up

Export Citation Format

Share Document