2015
DOI: 10.5120/20469-2324
|View full text |Cite
|
Sign up to set email alerts
|

Automatic Data Flow Test Paths Generation using the Genetical Swarm Optimization Technique

Abstract: Path testing requires generating all paths through the program to be tested, and finding a set of program inputs that will execute every path. The number of possible paths in programs containing loops is infinite, and so it is very difficult, if not impossible, to test all of them. Path testing can be relaxed by selecting a subset of all executable paths that fulfill a certain path selection criterion and finding test data to cover it. The automatic generation of such test paths leads to more test coverage pat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 29 publications
0
5
0
Order By: Relevance
“…Algorithm 2. Pseudocode of APGWO [39] Initialize The solution of the APGWO-wrapper is a binary array having a dimension of 1×n, where n is the total number of features. Selected features will take a value of 1, and 0 otherwise.…”
Section: ) Adaptive Particle -Grey Wolf Optimization (Apgwo)mentioning
confidence: 99%
“…Algorithm 2. Pseudocode of APGWO [39] Initialize The solution of the APGWO-wrapper is a binary array having a dimension of 1×n, where n is the total number of features. Selected features will take a value of 1, and 0 otherwise.…”
Section: ) Adaptive Particle -Grey Wolf Optimization (Apgwo)mentioning
confidence: 99%
“…Chawla et al [20] proposed a hybrid PSO and GA algorithm for automatic generation of test suites with branch coverage as the test adequacy criterion. The experiments are performed with ten Java container classes.…”
Section: Related Workmentioning
confidence: 99%
“…In this section, overall performance of the proposed hybrid (adaptive PSO and DE) algorithm is compared with DE, PSO, GA and random search with respect to the measures collected. Tables 7 -10, as given below, summarize the results of applying the various testing approaches to the set of chosen subject programs for (10,15,20,25). Range of the input integer variables is taken to be 0-100; range is different for variables of Program# 3, 4, and 7 as per the requirement of each program.…”
Section: Overall Comparisonmentioning
confidence: 99%
See 1 more Smart Citation
“…Ding et al [ 17] divided the population of GA into several swarms which were impacted by particle swarm optimisation (PSO) to increase the diversity of the population. Similarly, Girgis et al [18] composited GA and PSO to solve ATCG-PC. Srivastava et al [ 19] proposed a meta-heuristic algorithm of GA and ant colony optimisation (ACO) to increase the discovering rate of the uncovered paths.…”
Section: Introductionmentioning
confidence: 99%