JournalVolume 7, №1Genetic symbiosis algorithm generating test data for constraint automata (pages 126-137) Alireza Rezaee Abstract. Constraint automata are a semantic model for XML modeling language. Testing correctness of mapping black-box components in XML to constraint automata is an important problem in analyzing the semantic model of XML and requires a collection of test data that cover different scenarios. In this paper, Genetic Algorithm (GA) is employed to generate such set of test cases. This test data generation is improved by Genetic Symbiosis Algorithms (GSA). The results show that GSA approach brings us a set of test data with full coverage of automata edges and states and also diversity of examined paths.
|
|