International Conference on Formal Engineering Methods

ICFEM 2006: Formal Methods and Software Engineering pp 478-493

Generating Test Cases for Constraint Automata by Genetic Symbiosis Algorithm

  • Samira Tasharofi
  • Sepand Ansari
  • Marjan Sirjani
Conference paper

DOI: 10.1007/11901433_26

Volume 4260 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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.

Keywords

Constraint automata finite-state machine testing automatic test data generation genetic algorithms symbiotic evolutionary algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Samira Tasharofi
    • 1
  • Sepand Ansari
    • 1
  • Marjan Sirjani
    • 1
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of TehranTehranIran
  2. 2.School of Computer ScienceInstitute for Studies in Theoretical Physics and Mathematics (IPM)TehranIran