A preliminary general testing method based on genetic algorithms

Authors:
Luis M. Alonso;Pablo Rabanal;Ismael Rodríguez
Affiliations:
Dept. Sistemas Informáticos y Computación, Facultad de Informática, Universidad Complutense de Madrid, Madrid, Spain;Dept. Sistemas Informáticos y Computación, Facultad de Informática, Universidad Complutense de Madrid, Madrid, Spain;Dept. Sistemas Informáticos y Computación, Facultad de Informática, Universidad Complutense de Madrid, Madrid, Spain
Venue:
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Year:
2011

Citing 9
Cited 0

Confirming Configurations in EFSM Testing

IEEE Transactions on Software Engineering
Ant Colony Optimization

Ant Colony Optimization
Specification, testing and implementation relations for symbolic-probabilistic systems

Theoretical Computer Science
Automated Unique Input Output Sequence Generation for Conformance Testing of FSMs

The Computer Journal
Weak Mutation Testing and Completeness of Test Sets

IEEE Transactions on Software Engineering
Aiding Test Case Generation in Temporally Constrained State Based Systems Using Genetic Algorithms

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
A General Testability Theory

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Formal Approach to Heuristically Test Restorable Systems

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Using river formation dynamics to design heuristic algorithms

UC'07 Proceedings of the 6th international conference on Unconventional Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a testing methodology to find suitable test suites in environments where the application of each test to the implementation under test (IUT) might be very expensive in terms of cost or time. The method is general in the sense that it keeps very low the dependence on the underlying model (e.g. finite state machines, timed automata, Java programs, etc). A genetic algorithm (GA) is used to find optimal test suites according to cost and distinguishability criteria.