Please use this identifier to cite or link to this item:
                
    
    http://bura.brunel.ac.uk/handle/2438/4660| Title: | Checking experiments for stream X-machines | 
| Authors: | Hierons, RM | 
| Keywords: | Stream X-machines;Test generation;Checking experiment | 
| Issue Date: | 2010 | 
| Publisher: | Elsevier | 
| Citation: | Theoretical Computer Science, 411(37): 3372-3385, Aug 2010 | 
| Abstract: | Stream X-machines are a state based formalism that has associated with it a particular development process in which a system is built from trusted components. Testing thus essentially checks that these components have been combined in a correct manner and that the orders in which they can occur are consistent with the specification. Importantly, there are test generation methods that return a checking experiment: a test that is guaranteed to determine correctness as long as the implementation under test (IUT) is functionally equivalent to an unknown element of a given fault domain Ψ. Previous work has show how three methods for generating checking experiments from a finite state machine (FSM) can be adapted to testing from a stream X-machine. However, there are many other methods for generating checking experiments from an FSM and these have a variety of benefits that correspond to different testing scenarios. This paper shows how any method for generating a checking experiment from an FSM can be adapted to generate a checking experiment for testing an implementation against a stream X-machine. This is the case whether we are testing to check that the IUT is functionally equivalent to a specification or we are testing to check that every trace (input/output sequence) of the IUT is also a trace of a nondeterministic specification. Interestingly, this holds even if the fault domain Ψ used is not that traditionally associated with testing from a stream X-machine. The results also apply for both deterministic and nondeterministic implementations. | 
| Description: | This article is a post-print version of the published article which may be accessed at the link below. Copyright © 2010 Elsevier B.V. All rights reserved. | 
| URI: | http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V1G-505NSB3-4&_user=545641&_coverDate=08%2F07%2F2010&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_acct=C000027918&_version=1&_urlVersion=0&_userid=545641&md5=b1e873650892932c7b95711901ad4dc5&searchtype=a http://bura.brunel.ac.uk/handle/2438/4660 | 
| DOI: | http://dx.doi.org/10.1016/j.tcs.2010.05.014 | 
| ISSN: | 0304-3975 | 
| Appears in Collections: | Computer Science Dept of Computer Science Research Papers | 
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Fulltext.pdf | 355.24 kB | Adobe PDF | View/Open | 
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.

