Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/13621
Title: Mutation-based minimal test suite generation for Boolean expressions
Authors: Ayav, Tolga
Belli, Fevzi
Keywords: Software testing
Fault-based testing
Boolean functions
Mutation analysis
Integer linear programming
Publisher: World Scientific Publishing
Abstract: Boolean expressions are highly involved in control flows of programs and software specifications. Coverage criteria for Boolean expressions aim at producing minimal test suites to detect software faults. There exist various testing criteria, efficiency of which is usually evaluated through mutation analysis. This paper proposes an integer programming-based minimal test suite generation technique relying on mutation analysis. The proposed technique also takes into account the cost of fault detection. The technique is optimal such that the resulting test suite guarantees to detect all the mutants under given fault assumptions, while maximizing the average percentage of fault detection of a test suite. Therefore, the approach presented can also be considered as a reference method to check the efficiency of any common technique. The method is evaluated using four well-known real benchmark sets of Boolean expressions and is also exemplary compared with MCDC criterion. The results show that the test suites generated by the proposed method provide better fault coverage values and faster fault detection.
URI: https://doi.org/10.1142/S0218194023500183
https://hdl.handle.net/11147/13621
ISSN: 0218-1940
1793-6403
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

Show full item record



CORE Recommender

SCOPUSTM   
Citations

3
checked on Nov 29, 2024

WEB OF SCIENCETM
Citations

2
checked on Nov 9, 2024

Page view(s)

196
checked on Dec 2, 2024

Google ScholarTM

Check




Altmetric


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