Generating test cases for constraint automata by genetic symbiosis algorithm

Authors:
Samira Tasharofi;Sepand Ansari;Marjan Sirjani
Affiliations:
Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran
Venue:
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Year:
2006

Citing 18
Cited 0

A protocol test generation procedure

Computer Networks and ISDN Systems
Test Selection Based on Finite State Models

IEEE Transactions on Software Engineering
An introduction to genetic algorithms

An introduction to genetic algorithms
Automated program flaw finding using simulated annealing

Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Automatic test data generation for path testing using GAs

Information Sciences: an International Journal
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method

IEEE Transactions on Software Engineering
Generating Software Test Data by Evolution

IEEE Transactions on Software Engineering
Testing Transition Systems: An Annotated Bibliography

MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
STG: A Symbolic Test Generation Tool

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Using On-The-Fly Verification Techniques for the Generation of test Suites

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Formal Test Automation: A Simple Experiment

Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Generating Test Cases for a Timed I/O Automaton Model

Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Reo: a channel-based coordination model for component composition

Mathematical Structures in Computer Science
Modeling component connectors in Reo by constraint automata

Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Testing Software Design Modeled by Finite-State Machines

IEEE Transactions on Software Engineering
Fault detecting experiments for sequential circuits

SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Automated Mapping of Reo Circuits to Constraint Automata

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.