H. Turgut Uyar
ABSTRACT
Evolutionary algorithms are among the metaheuristic search methods that have been applied to the structural test data generation problem. Fitness evaluation methods play an important role in the performance of evolutionary algorithms and various methods have been devised for this problem. In this paper, we propose a new fitness evaluation method based on pairwise sequence comparison also used in bioinformatics. Our preliminary study shows that this method is easy to implement and produces promising results.
- A. E. Eiben and J. E. Smith. Introduction to Evolutionary Computing. Springer, 1st edition, Nov. 2003. Google Scholar
Digital Library
- Mark Fewster and Dorothy Graham. Software Test Automation. ACM Press, 1999. Google ScholarDigital Library
- D. S. Hirshberg. A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18(6):341--343, 1975. Google ScholarDigital Library
- P. McMinn. Search-based software test data generation: A survey. Software Testing Verification and Reliability, 14(2):105--156, June 2004. Google ScholarDigital Library
- D. W. Mount. Bioinformatics: Sequence and Genome Analysis. Cold Spring Harbor Laboratory Press, 2nd edition, June 2004.Google Scholar
- J. Wegener, K. Buhr, and H. Pohlheim. Automatic test data generation for structural testing of embedded software systems by evolutionary testing. In GECCO '02: Proceedings of the Genetic and Evolutionary Computation Conference, pages 1233--1240, 2002. Google ScholarDigital Library
Index Terms
- Pairwise sequence comparison for fitness evaluation in evolutionary structural software testing
Recommendations
An extensive evaluation of search-based software testing: a review
In recent years, search-based software testing (SBST) is the active research topic in software testing. SBST is the process of generating test cases that use metaheuristics for optimization of a task in the framework of software testing to solve ...
Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformaticsThis paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed ...
Fitness diversification in the service of fitness optimization: a comparison study
GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference CompanionBlindly chasing after fitness is not the best strategy for optimization of hard problems, as it usually leads to premature convergence and getting stuck in low-quality local optima. Several techniques such as niching or quality-diversity algorithms have ...
Comments