|
Brunel University Research Archive (BURA) >
Research Areas >
Information Systems and Computing >
Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/340
|
| Title: | Constructing multiple unique input/output sequences using metaheuristic optimisation techniques |
| Authors: | Guo, Q Hierons, RM Harman, M Derderian, K |
| Keywords: | Heuristic method NP hard problem Genetic algorithm Simulated annealing Optimization method |
| Publication Date: | 2005 |
| Publisher: | Institution of Engineering and Technology |
| Citation: | IEE Proceedings - Software 152 (3): 127-140, Jun 2005 |
| Abstract: | Multiple unique input/output sequences (UIOs) are often used to generate robust and compact test sequences in finite state machine (FSM) based testing. However, computing UIOs is NP-hard. Metaheuristic optimisation techniques (MOTs) such as genetic algorithms (GAs) and simulated annealing (SA) are effective in providing good solutions for some NP-hard problems. In the paper, the authors investigate the construction of UIOs by using MOTs. They define a fitness function to guide the search for potential UIOs and use sharing techniques to encourage MOTs to locate UIOs that are calculated as local optima in a search domain. They also compare the performance of GA and SA for UIO construction. Experimental results suggest that, after using a sharing technique, both GA and SA can find a majority of UIOs from the models under test. |
| URI: | http://www.iee.org/Publish/Journals/ProfJourn/Proc/SEN/index.cfm http://bura.brunel.ac.uk/handle/2438/340 |
| DOI: | http://dx.doi.org/10.1049/ip-sen:20045001 |
| Appears in Collections: | B-SERC Research Papers Information Systems and Computing School of Information Systems, Computing and Mathematics Research Papers
|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.
|