ACM Home Page
Please provide us with feedback. Feedback
Empirical analysis of a genetic algorithm-based stress test technique
Full text PdfPdf (353 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
SESSION: Search-based software engineering papers table of contents
Pages 1743-1750  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Author
Vahid Garousi  University of Calgary, Calgary, AB, Canada
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 142,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389433
What is a DOI?

ABSTRACT

Evolutionary testing denotes the use of evolutionary algorithms, e.g., Genetic Algorithms (GAs), to support various test automation tasks. Since evolutionary algorithms are heuristics, their performance and output efficiency can vary across multiple runs. Therefore, there is a strong need to empirically investigate the capacity of evolutionary test techniques to achieve the desired objectives (e.g., generate stress test cases) and their scalability in terms of the complexity of the System Under Test (SUT), the inputs, and the control parameters of the search algorithms. In a previous work, we presented a GA-based UML-driven, stress test technique aimed at increasing chances of discovering faults related to network traffic in distributed real-time software. This paper reports a carefully-designed empirical study which was conducted to analyze and improve the applicability, efficiency and effectiveness of the above GA-based stress test technique. Detailed stages and objectives of the empirical analysis are reported. The findings of the study are furthermore used to better calibrate the parameters of the GA-based stress test technique.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Object Management Group (OMG), "UML 2.1.1 Superstructure Specification," 2007.
 
4
5
 
6
 
7
 
8
Y. Min, X. Jin, X. Su, and B. Peng, "Empirical Analysis of the Spatial Genetic Algorithm on Small-World Networks," Proc. of Int. Conf. on Computational Science, pp. 1032--1039, 2006.
 
9
G. Rudolph, "Convergence Analysis of Canonical Genetic Algorithms," IEEE Transactions on Neural Networks, vol. 5, no. 1, pp. 96--101, 1994.
10
 
11
12
13
 
14
 
15
 
16
 
17
V. Garousi, "GARUS (Genetic Algorithm-based test Requirement tool for real-time distribUted Systems)," http://www.enel.ucalgary.ca/~vgarousi/tools/GARUS, 2006.
 
18
 
19
M. Wall, "GAlib: A C++ Library of Genetic Algorithm Components," Documentation version 2.4, Massachusetts Institute of Technology 1996.
 
20
S. J. Louis and G. J. E. Rawlins, "Predicting Convergence Time for Genetic Algorithms," Technical Report 370, Computer Science Department, Indiana University 1993.
 
21
 
22