2010 Third International Conference on Software Testing, Verification and Validation (2010)
Apr. 6, 2010 to Apr. 9, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICST.2010.39
Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be executed on the GUI, and then use the graphs to generate test cases (event sequences) that achieve a specified coverage goal. However, because these models are only approximations of the actual event flows, the generated test cases may suffer from problems of infeasibility, i.e., some events may not be available for execution causing the test case to terminate prematurely. In this paper we develop a method to automatically repair GUI test suites, generating new test cases that are feasible. We use a genetic algorithm to evolve new test cases that increase our test suite's coverage while avoiding infeasible sequences. We experiment with this algorithm on a set of synthetic programs containing different types of constraints and for test sequences of varying lengths. Our results suggest that we can generate new test cases to cover most of the feasible coverage and that the genetic algorithm outperforms a random algorithm trying to achieve the same goal in almost all cases.
GUI Testing, Combinatorial Interaction Testing, Genetic Algorithms, Automated Test Case Generation
S. Huang, A. M. Memon and M. B. Cohen, "Repairing GUI Test Suites Using a Genetic Algorithm," 2010 Third International Conference on Software Testing, Verification and Validation(ICST), Paris, France, 2010, pp. 245-254.