Generating Test Cases for Constraint Automata by Genetic Symbiosis Algorithm
- Cite this paper as:
- Tasharofi S., Ansari S., Sirjani M. (2006) Generating Test Cases for Constraint Automata by Genetic Symbiosis Algorithm. In: Liu Z., He J. (eds) Formal Methods and Software Engineering. ICFEM 2006. Lecture Notes in Computer Science, vol 4260. Springer, Berlin, Heidelberg
Constraint automata are a semantic model for Reo modeling language. Testing correctness of mapping black-box components in Reo to constraint automata is an important problem in analyzing the semantic model of Reo. This testing requires a suite of test cases that cover the automaton states and transitions and also examine different paths. In this paper, Genetic Algorithm (GA) is employed to generate such suite of test cases. This test data generation is improved by Genetic Symbiosis Algorithm (GSA). The results show that GSA approach brings us a suite of test cases with full coverage of automata states and transitions and also diversity of examined paths.
KeywordsConstraint automata finite-state machine testing automatic test data generation genetic algorithms symbiotic evolutionary algorithms
Unable to display preview. Download preview PDF.