Automated black-box boundary value detection

Author:

Dobslaw Felix1,Feldt Robert2,Gomes de Oliveira Neto Francisco3

Affiliation:

1. Department of Communication, Quality Management and Information Systems, Mid Sweden University, Östersund, Jämtland, Sweden

2. Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Västra Götaland, Sweden

3. Department of Computer Science and Engineering, University of Gothenburg, Gothenburg, Västra Götaland, Sweden

Abstract

Software systems typically have an input domain that can be subdivided into sub-domains, each of which generates similar or related outputs. Testing it on the boundaries between these sub-domains is critical to ensure high-quality software. Therefore, boundary value analysis and testing have been a fundamental part of the software testing toolbox for a long time and are typically taught early to software engineering students. Despite its many argued benefits, boundary value analysis for a given software specification or application is typically described in abstract terms. This allows for variation in how testers apply it and in the benefits they see. Additionally, its adoption has been limited since it requires a specification or model to be analysed. We propose an automated black-box boundary value detection method to support software testers in performing systematic boundary value analysis. This dynamic method can be utilized even without a specification or model. The proposed method is based on a metric referred to as the program derivative, which quantifies the level of boundariness of test inputs. By combining this metric with search algorithms, we can identify and rank pairs of inputs as good boundary candidates, i.e., inputs that are in close proximity to each other but with outputs that are far apart. We have implemented the AutoBVA approach and evaluated it on a curated dataset of example programs. Furthermore, we have applied the approach broadly to a sample of 613 functions from the base library of the Julia programming language. The approach could identify boundary candidates that highlight diverse boundary behaviours in over 70% of investigated systems under test. The results demonstrate that even a simple variant of the program derivative, combined with broad sampling and search over the input space, can identify interesting boundary candidates for a significant portion of the functions under investigation. In conclusion, we also discuss the future extension of the approach to encompass more complex systems under test cases and datatypes.

Funder

The Swedish National Infrastructure for Computing (SNIC), Swedish Research Council

Publisher

PeerJ

Subject

General Computer Science

Reference42 articles.

1. A systematic review of search-based testing for non-functional system properties;Afzal;Information and Software Technology,2009

2. Random testing: theoretical results and practical implications;Arcuri;IEEE Transactions on Software Engineering,2011

3. Usage and attribution of stack overflow code snippets in GitHub projects;Baltes;Empirical Software Engineering,2019

4. Synthesizing program input grammars;Bastani;ACM SIGPLAN Notices,2017

5. An input space modeling methodology for combinatorial testing;Borazjany,2013

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Causal Test Adequacy;2024 IEEE Conference on Software Testing, Verification and Validation (ICST);2024-05-27

2. Automated Boundary Identification for Machine Learning Classifiers;Proceedings of the 17th ACM/IEEE International Workshop on Search-Based and Fuzz Testing;2024-04-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3