.png){kind=icon}
返回
Randomized Quasi-Random Testing
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2015.2455981.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Randomtesting is a fundamental testing technique that can be used to generate test cases for both hardware and software systems. Quasi-randomtesting was proposed as an enhancement to the cost-effectiveness of randomtesting: In addition to having similar computation overheads to randomtesting, it makes use of quasi-random sequences to generate low-discrepancy and low-dispersion test cases that help deliver high failure-detection effectiveness. Currently, few algorithms exist to generate quasi-random sequences, and these are mostly deterministic, rather than random. A previous study of quasi-random testing has examined two methods for randomizing quasi-random sequences to improve their applicability in testing. However, these randomization methods still have shortcomings-one method does not introduce much randomness to the test cases, while the other does not support incremental test case generation. In this paper, we present an innovative approach to incrementally randomizing quasi-random sequences. The test cases generated by this new approach show a high degree of randomness and evenness in distribution. We also conduct simulations and empirical studies to demonstrate the applicability and effectiveness of our approach in software testing.
Keyword:
Random testing
quasi-random testing
randomized quasi-random sequence
adaptive random testing
failure-detection effectiveness
test case distribution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
.png){kind=icon}
查看更多内容