Optimal test case generation for boundary value analysis

被引:1
作者
Guo, Xiujing [1 ]
Okamura, Hiroyuki [1 ]
Dohi, Tadashi [1 ]
机构
[1] Hiroshima Univ, Grad Sch Adv Sci & Engn, 1 Chome-2 Kagamiyama, Hiroshima 7398511, Japan
关键词
Software testing; Boundary value analysis; Test input generation; Boundary coverage; Random testing; DOMAIN; COVERAGE;
D O I
10.1007/s11219-023-09659-9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Boundary value analysis (BVA) is a common technique in software testing that uses input values that lie at the boundaries where significant changes in behavior are expected. This approach is widely recognized and used as a natural and effective strategy for testing software. Test coverage is one of the criteria to measure how much the software execution paths are covered by the set of test cases. This paper focuses on evaluating test coverage with respect to BVA by defining a metric called boundary coverage distance (BCD). The BCD metric measures the extent to which a test set covers the boundaries. In addition, based on BCD, we consider the optimal test input generation to minimize BCD under the random testing scheme. We propose three algorithms, each representing a different test input generation strategy, and evaluate their fault detection capabilities through experimental validation. The results indicate that the BCD-based approach has the potential to generate boundary values and improve the effectiveness of software testing.
引用
收藏
页码:543 / 566
页数:24
相关论文
共 24 条
[1]  
Ali S, 2016, IEEE C EVOL COMPUTAT, P379, DOI 10.1109/CEC.2016.7743819
[2]  
[Anonymous], 2010, 2010 IEEE International Conference on Software Maintenance
[3]  
Awedikian Z., 2009, P 11 ANN C GEN EV CO, P1657
[4]  
Cadar C., 2008, OSDI, P209, DOI DOI 10.5555/1855741.1855756
[5]  
Chen TY, 2004, LECT NOTES COMPUT SC, V3321, P320
[6]   UNDERSTANDING THE METROPOLIS-HASTINGS ALGORITHM [J].
CHIB, S ;
GREENBERG, E .
AMERICAN STATISTICIAN, 1995, 49 (04) :327-335
[7]   APPLICABILITY OF MODIFIED CONDITION DECISION COVERAGE TO SOFTWARE TESTING [J].
CHILENSKI, JJ ;
MILLER, SP .
SOFTWARE ENGINEERING JOURNAL, 1994, 9 (05) :193-200
[8]   A CLOSE LOOK AT DOMAIN TESTING [J].
CLARKE, LA ;
HASSELL, J ;
RICHARDSON, DJ .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1982, 8 (04) :380-390
[9]   Boundary Value Exploration for Software Analysis [J].
Dobslaw, Felix ;
Neto, Francisco Gomes de Oliveira ;
Feldt, Robert .
2020 IEEE 13TH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW), 2020, :346-353
[10]   An extensible SAT-solver [J].
Eén, N ;
Sörensson, N .
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 :502-518