Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/9788
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hierons, RM | - |
dc.date.accessioned | 2015-01-19T11:08:44Z | - |
dc.date.available | 2015-01-19T11:08:44Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | The Computer Journal, 56(11): 1305 - 1319, (2013) | en_US |
dc.identifier.uri | http://comjnl.oxfordjournals.org/content/56/11/1305 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/9788 | - |
dc.description.abstract | This paper concerns testing from an input output transition system (IOTS) model of a system under test that interacts with its environment through asynchronous first in first out (FIFO) channels. It explores methods for analysing an IOTS without modelling the channels. If IOTS M produces sequence $\sigma$ then, since communications are asynchronous, output can be delayed and so a different sequence might be observed. Thus M defines a language Tr(M) of sequences that can be observed when interacting with M through FIFO channels. We define implementation relations and equivalences in terms of Tr(M): an implementation relation says how IOTS N must relate to IOTS M in order for N to be a correct implementation of M. It is important to use an appropriate implementation relation since otherwise the verdict from a test run might be incorrect and because it influences test generation. It is undecidable whether IOTS N conforms to IOTS M and so also whether there is a test case that can distinguish between two IOTSs. We also investigate the situation in which we have a finite automaton P and either wish to know whether $Tr(M) \cap L(P)$ is empty or whether $Tr(M) \cap \tr(P)$ is empty and prove that these are undecidable. In addition, we give conditions under which conformance and intersection are decidable. | en_US |
dc.description.sponsorship | This work was partially supported by EPSRC grant EP/G04354X/1:The Birth, Life and Death of Semantic Mutants. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Oxford University Press | en_US |
dc.subject | Implementation relations | en_US |
dc.subject | Software testing | en_US |
dc.subject | Asynchronous communications | en_US |
dc.subject | First in first out channels | en_US |
dc.title | Implementation relations for testing through asynchronous channels | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1093/comjnl/bxs107 | - |
pubs.organisational-data | /Brunel | - |
pubs.organisational-data | /Brunel/Brunel Active Staff | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths/IS and Computing | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups/Centre for Information and Knowledge Management | - |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 290.88 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.