| Empirical analysis of a genetic algorithm-based stress test technique |
| Full text |
Pdf
(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
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 11, Downloads (12 Months): 142, Citation Count: 0
|
|
|
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
|
Jeffrey J. P. Tsai , Yaodong Bi , Steve J. H. Yang , Ross A. W. Smith, Distributed real-time systems: monitoring, visualization, debugging, and analysis, John Wiley & Sons, Inc., New York, NY, 1996
|
| |
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
|
Mark Harman , Youssef Hassoun , Kiran Lakhotia , Phil McMinn , Joachim Wegener, The impact of input domain reduction on search-based test data generation, Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, September 03-07, 2007, Dubrovnik, Croatia
[doi> 10.1145/1287624.1287647]
|
 |
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
|
|
|