Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/363
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHierons, RM-
dc.coverage.spatial21en
dc.date.accessioned2006-11-07T15:22:00Z-
dc.date.available2006-11-07T15:22:00Z-
dc.date.issued2002-
dc.identifier.citationACM Transactions On Software Engineering and Methodology, 11(4): 427-448, 2002en
dc.identifier.urihttp://www.acm.org/pubs/tosem/en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/363-
dc.description.abstractA number of authors have considered the problem of comparing test sets and criteria. Ideally test sets are compared using a preorder with the property that test set T1 is at least as strong as T2 if whenever T2 determines that an implementation p is faulty, T1 will also determine that p is faulty. This notion can be extended to test criteria. However, it has been noted that very few test sets and criteria are comparable under such an ordering; instead orderings are based on weaker properties such as subsumes. This paper explores an alternative approach, in which comparisons are made in the presence of a test hypothesis or fault domain. This approach allows strong statements about fault detecting ability to be made and yet for a number of test sets and criteria to be comparable. It may also drive incremental test generation.en
dc.format.extent705454 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherAssociation For Computing Machinery Press, New York, NY, USAen
dc.subjectTheoryen
dc.subjectVerificationen
dc.subjectFault domainsen
dc.titleComparing test sets and criteria in the presence of test hypotheses and fault domainsen
dc.typeResearch Paperen
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Comparing test sets.pdf688.92 kBAdobe PDFView/Open


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