Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHierons, RM-
dc.contributor.authorMerayo, MG-
dc.contributor.authorNunez, M-
dc.identifier.citationJournal of Logic and Algebraic Methods in Programmingen_US
dc.description.abstractIn passive testing a monitor observes the trace (sequence of inputs and outputs) of the system under test (SUT) and checks that this trace satisfies a given property $P$, potentially triggering a response if an incorrect behaviour is observed. Recent work has explored a variant of passive testing, in which we have a required property $P$ of the traces of the SUT and there is a first-in-first-out (FIFO) network between the SUT and the monitor. The problem here is that the trace observed by the monitor need not be that produced by the SUT. Previous work has shown how such asynchronous passive testing can be performed if the property $P$ is defined by a pair $(\rho,O_{\rho})$ that represents the requirement that if trace $\rho$ is produced by the SUT then the next output must be from the set $O_{\rho}$. This paper generalises the previous work to the case where the property $P$ is defined by a finite automaton.en_US
dc.subjectFormal approaches to testingen_US
dc.subjectPassive testingen_US
dc.subjectAsynchronous testingen_US
dc.titleAn extended framework for passive asynchronous testingen_US
dc.relation.isPartOfJournal of Logic and Algebraic Methods in Programming-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf308.11 kBUnknownView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.