Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/350
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hierons, RM | - |
dc.contributor.author | Harman, M | - |
dc.coverage.spatial | 29 | en |
dc.date.accessioned | 2006-11-06T12:04:30Z | - |
dc.date.available | 2006-11-06T12:04:30Z | - |
dc.date.issued | 2000 | - |
dc.identifier.citation | Formal Aspects of Computing, 12(6): 423-442 | en |
dc.identifier.uri | http://www.springerlink.com/content/w5dlnh02khp4l5jt/ | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/350 | - |
dc.description.abstract | Stream X-machines have been used in order to specify a range of systems. One of the strengths of this approach is that, under certain well-defined conditions, it is possible to produce a finite test that is guaranteed to determine the correctness of the implementation under test (IUT). Initially only deterministic stream X-machines were considered in the literature. This is largely because the standard test algorithm relies on the stream X-machine being deterministic. More recently the problem of testing to determine whether the IUT is equivalent to a non-deterministic stream X-machine specification has been tackled. Since non-determinism can be important for specifications, this is an extremely useful extension. In many cases, however, we wish to test for a weaker notion of correctness called conformance. This paper considers a particular form of non-determinism, within stream X-machines, that will be called quasi-non-determinism. It then investigates the generation of tests that are guaranteed to determine whether the IUT conforms to a quasi-non-deterministic stream X-machine specification. The test generation algorithm given is a generalisation of that used for testing from a deterministic stream X-machine. | en |
dc.format.extent | 620733 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Springer London | en |
dc.subject | Formal language | en |
dc.subject | Automaton | en |
dc.subject | Finite state machine | en |
dc.subject | Vending machine | en |
dc.subject | Design | en |
dc.subject | Test | en |
dc.subject | Stream | en |
dc.subject | Machine | en |
dc.subject | System | en |
dc.subject | Implementation | en |
dc.subject | Algorithm | en |
dc.subject | Specification | en |
dc.subject | Non determinism | en |
dc.subject | Generation | en |
dc.subject | X machine | en |
dc.subject | Conformance test | en |
dc.subject | Non deterministic stream X machine | en |
dc.subject | Test generation | en |
dc.title | Testing conformance to a quasi-non-deterministic stream X-machine | en |
dc.type | Research Paper | en |
dc.identifier.doi | http://dx.doi.org/10.1007/s001650070003 | - |
Appears in Collections: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Testing Conformance.pdf | 606.18 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.