|
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/345
|
| Title: | Generating candidates when testing a deterministic implementation against a non-deterministic finite-state machine |
| Authors: | Hierons, RM |
| Keywords: | Non-deterministic finite static machine Deterministic implementation Conformance testing Test derivation |
| Publication Date: | 2002 |
| Publisher: | Oxford University Press |
| Citation: | The Computer Journal 46(3):307-318 |
| Abstract: | This paper considers the problem of testing a deterministic system against a non-deterministic
finite-state machine. An adaptive test process, with two phases, is proposed. The paper focuses
on the first stage which involves testing to generate a candidate deterministic finite-state machine.
This candidate has the property that, under the test hypotheses used, the implementation is correct if and only if it is equivalent to the candidate. A test may then be derived from the candidate. |
| URI: | doi:10.1093/comjnl/46.3.307 http://bura.brunel.ac.uk/handle/2438/345 |
| 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.
|