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 |
Issue 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: | http://bura.brunel.ac.uk/handle/2438/345 http://comjnl.oxfordjournals.org/cgi/content/abstract/46/3/307 |
DOI: | http://dx.doi.org/10.1093/comjnl/46.3.307 |
Appears in Collections: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 510.26 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.