Generating candidates when testing a deterministic implementation against a non-deterministic finite-state machine

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/345

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hierons, RM	-
dc.coverage.spatial	16	en
dc.date.accessioned	2006-11-06T10:03:01Z	-
dc.date.available	2006-11-06T10:03:01Z	-
dc.date.issued	2002	-
dc.identifier.citation	The Computer Journal 46(3):307-318	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/345	-
dc.identifier.uri	http://comjnl.oxfordjournals.org/cgi/content/abstract/46/3/307	en
dc.description.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.	en
dc.format.extent	522508 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Oxford University Press	en
dc.subject	Non-deterministic finite static machine	en
dc.subject	Deterministic implementation	en
dc.subject	Conformance testing	en
dc.subject	Test derivation	en
dc.title	Generating candidates when testing a deterministic implementation against a non-deterministic finite-state machine	en
dc.type	Research Paper	-
dc.identifier.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