Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/6065
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAyav, Tolga-
dc.date.accessioned2017-08-10T07:38:56Z
dc.date.available2017-08-10T07:38:56Z
dc.date.issued2017-08
dc.identifier.citationAyav, T. (2017). Prioritizing MCDC test cases by spectral analysis of Boolean functions. Software Testing, Verification and Reliability. doi:10.1002/stvr.1641en_US
dc.identifier.issn0960-0833
dc.identifier.issn0960-0833-
dc.identifier.issn1099-1689-
dc.identifier.urihttp://doi.org/10.1002/stvr.1641
dc.identifier.urihttp://hdl.handle.net/11147/6065
dc.description.abstractTest case prioritization aims at scheduling test cases in an order that improves some performance goal. One performance goal is a measure of how quickly faults are detected. Such prioritization can be performed by exploiting the Fault Exposing Potential (FEP) parameters associated to the test cases. FEP is usually approximated by mutation analysis under certain fault assumptions. Although this technique is effective, it could be relatively expensive compared to the other prioritization techniques. This study proposes a cost-effective FEP approximation for prioritizing Modified Condition Decision Coverage (MCDC) test cases. A strict negative correlation between the FEP of a MCDC test case and the influence value of the associated input condition allows to order the test cases easily without the need of an extensive mutation analysis. The method is entirely based on mathematics and it provides useful insight into how spectral analysis of Boolean functions can benefit software testing.en_US
dc.language.isoenen_US
dc.publisherJohn Wiley and Sons Inc.en_US
dc.relation.ispartofSoftware Testing Verification and Reliabilityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectTest prioritizationen_US
dc.subjectMCDCen_US
dc.subjectBoolean functionsen_US
dc.subjectSpectral analysisen_US
dc.subjectMutation analysisen_US
dc.titlePrioritizing MCDC test cases by spectral analysis of Boolean functionsen_US
dc.typeArticleen_US
dc.authoridTR114453en_US
dc.institutionauthorAyav, Tolga-
dc.departmentIzmir Institute of Technology. Computer Engineeringen_US
dc.identifier.wosWOS:000417437200003en_US
dc.identifier.scopus2-s2.0-85026497025en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.1002/stvr.1641-
dc.relation.doi10.1002/stvr.1641en_US
dc.coverage.doi10.1002/stvr.1641en_US
dc.identifier.scopusqualityQ2-
item.fulltextWith Fulltext-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextopen-
crisitem.author.dept03.04. Department of Computer Engineering-
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File Description SizeFormat 
6065.pdfMakale420.34 kBAdobe PDFThumbnail
View/Open
Show simple item record

CORE Recommender

SCOPUSTM   
Citations

1
checked on Dec 3, 2022

WEB OF SCIENCETM
Citations

1
checked on Dec 3, 2022

Page view(s)

148
checked on Dec 5, 2022

Download(s)

526
checked on Dec 5, 2022

Google ScholarTM

Check

Altmetric


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