Author:
Guo Xiujing,Okamura Hiroyuki,Dohi Tadashi
Abstract
AbstractBoundary 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.
Publisher
Springer Science and Business Media LLC
Reference24 articles.
1. Ali, S., Yue, T., Qiu, X., et al. (2016). Generating boundary values from OCL constraints using constraints rewriting and search algorithms[C]//2016 IEEE Congress on Evolutionary Computation (CEC). IEEE, 379–386.
2. Awedikian, Z., Ayari, K., & Antoniol, G. (2009). MC/DC automatic test input data generation[C]//Proceedings of the 11th Annual conference on Genetic and evolutionary computation. 1657–1664.
3. Cadar, C., Dunbar, D., & Engler, D. R. (2008). KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs[C]//OSDI, 8:209–224.
4. Chilenski, J. J., & Miller, S. P. (1994). Applicability of modified condition/decision coverage to software testing[J]. Software Engineering Journal, 9(5), 193–200.
5. Chen, T. Y., Leung, H., & Mak, I. K. (2004). Adaptive random testing[C]//Annual Asian Computing Science Conference (pp. 320–329). Berlin, Heidelberg: Springer.