一个可伸缩的t型覆盖估计器

Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, Vinodchandran N. Variyam
{"title":"一个可伸缩的t型覆盖估计器","authors":"Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, Vinodchandran N. Variyam","doi":"10.1145/3510003.3510218","DOIUrl":null,"url":null,"abstract":"Owing to the pervasiveness of software in our modern lives, software systems have evolved to be highly configurable. Combinatorial testing has emerged as a dominant paradigm for testing highly configurable systems. Often constraints are employed to define the environments where a given system under test (SUT) is expected to work. Therefore, there has been a sustained interest in designing constraint-based test suite generation techniques. A significant goal of test suite generation techniques is to achieve $t$-wise coverage for higher values of $t$. Therefore, designing scalable techniques that can estimate $t$-wise coverage for a given set of tests and/or the estimation of maximum achievable $t$-wise coverage under a given set of constraints is of crucial importance. The existing estimation techniques face significant scalability hurdles. The primary scientific contribution of this work is the design of scalable algorithms with mathematical guarantees to estimate (i) $t$-wise coverage for a given set of tests, and (ii) maximum $t$-wise coverage for a given set of constraints. In particular, we design a scalable framework ApproxCov that takes in a test set $\\mathcal{U}$, a coverage parameter $t$, a tolerance parameter $\\varepsilon$, and a confidence parameter $\\delta$, and returns an estimate of the t-wise coverage of $\\mathcal{U}$ that is guaranteed to be within ($1\\pm \\varepsilon$) -factor of the ground truth with probability at least $1-\\delta$. We design a scalable framework ApproxMaxCov that, for a given formula $\\mathsf{F}$, a coverage parameter $t$, a tolerance parameter $\\varepsilon$, and a confidence parameter $\\delta$, outputs an approximation which is guaranteed to be within ($1\\pm\\varepsilon$) factor of the maximum achievable $t$-wise coverage under $\\mathsf{F}$, with probability $\\geq 1-\\delta$. Our comprehensive evaluation demonstrates that ApproxCov and ApproxMaxCov can handle benchmarks that are beyond the reach of current state-of-the-art approaches. We believe that the availability of ApproxCov and ApproxMaxCov will enable test suite designers to evaluate the effectiveness of their generators and thereby significantly impact the development of combinatorial testing techniques.","PeriodicalId":202896,"journal":{"name":"2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Scalable t-wise Coverage Estimator\",\"authors\":\"Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, Vinodchandran N. Variyam\",\"doi\":\"10.1145/3510003.3510218\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Owing to the pervasiveness of software in our modern lives, software systems have evolved to be highly configurable. Combinatorial testing has emerged as a dominant paradigm for testing highly configurable systems. Often constraints are employed to define the environments where a given system under test (SUT) is expected to work. Therefore, there has been a sustained interest in designing constraint-based test suite generation techniques. A significant goal of test suite generation techniques is to achieve $t$-wise coverage for higher values of $t$. Therefore, designing scalable techniques that can estimate $t$-wise coverage for a given set of tests and/or the estimation of maximum achievable $t$-wise coverage under a given set of constraints is of crucial importance. The existing estimation techniques face significant scalability hurdles. The primary scientific contribution of this work is the design of scalable algorithms with mathematical guarantees to estimate (i) $t$-wise coverage for a given set of tests, and (ii) maximum $t$-wise coverage for a given set of constraints. In particular, we design a scalable framework ApproxCov that takes in a test set $\\\\mathcal{U}$, a coverage parameter $t$, a tolerance parameter $\\\\varepsilon$, and a confidence parameter $\\\\delta$, and returns an estimate of the t-wise coverage of $\\\\mathcal{U}$ that is guaranteed to be within ($1\\\\pm \\\\varepsilon$) -factor of the ground truth with probability at least $1-\\\\delta$. We design a scalable framework ApproxMaxCov that, for a given formula $\\\\mathsf{F}$, a coverage parameter $t$, a tolerance parameter $\\\\varepsilon$, and a confidence parameter $\\\\delta$, outputs an approximation which is guaranteed to be within ($1\\\\pm\\\\varepsilon$) factor of the maximum achievable $t$-wise coverage under $\\\\mathsf{F}$, with probability $\\\\geq 1-\\\\delta$. Our comprehensive evaluation demonstrates that ApproxCov and ApproxMaxCov can handle benchmarks that are beyond the reach of current state-of-the-art approaches. We believe that the availability of ApproxCov and ApproxMaxCov will enable test suite designers to evaluate the effectiveness of their generators and thereby significantly impact the development of combinatorial testing techniques.\",\"PeriodicalId\":202896,\"journal\":{\"name\":\"2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3510003.3510218\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3510003.3510218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

由于软件在我们现代生活中的普及,软件系统已经进化为高度可配置的。组合测试已经成为测试高度可配置系统的主要范例。通常使用约束来定义给定的被测系统(SUT)预期工作的环境。因此,人们对设计基于约束的测试套件生成技术一直很感兴趣。测试套件生成技术的一个重要目标是为更高的$t$值实现$t$明智的覆盖。因此,设计可伸缩的技术,为给定的一组测试估计$t$明智的覆盖率和/或在给定的一组约束下估计最大可实现的$t$明智的覆盖率是至关重要的。现有的评估技术面临着显著的可伸缩性障碍。这项工作的主要科学贡献是设计了具有数学保证的可扩展算法,以估计(i)给定一组测试的$t$明智覆盖率,以及(ii)给定一组约束的最大$t$明智覆盖率。特别是,我们设计了一个可扩展的框架ApproxCov,它接受一个测试集$\mathcal{U}$、一个覆盖率参数$t$、一个容差参数$\varepsilon$和一个置信度参数$\delta$,并返回对$\mathcal{U}$的t-wise覆盖率的估计,该估计保证在($1\pm \varepsilon$) -基本事实的因子范围内,概率至少为$1-\delta$。我们设计了一个可扩展的框架ApproxMaxCov,对于给定的公式$\mathsf{F}$,覆盖参数$t$,容差参数$\varepsilon$和置信度参数$\delta$,输出一个近似值,该近似值保证在$\mathsf{F}$下可实现的最大$t$覆盖($1\pm\varepsilon$)因子内,概率为$\geq 1-\delta$。我们的综合评估表明,ApproxCov和ApproxMaxCov可以处理当前最先进的方法无法达到的基准测试。我们相信,ApproxCov和ApproxMaxCov的可用性将使测试套件设计人员能够评估其生成器的有效性,从而显著影响组合测试技术的发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Scalable t-wise Coverage Estimator
Owing to the pervasiveness of software in our modern lives, software systems have evolved to be highly configurable. Combinatorial testing has emerged as a dominant paradigm for testing highly configurable systems. Often constraints are employed to define the environments where a given system under test (SUT) is expected to work. Therefore, there has been a sustained interest in designing constraint-based test suite generation techniques. A significant goal of test suite generation techniques is to achieve $t$-wise coverage for higher values of $t$. Therefore, designing scalable techniques that can estimate $t$-wise coverage for a given set of tests and/or the estimation of maximum achievable $t$-wise coverage under a given set of constraints is of crucial importance. The existing estimation techniques face significant scalability hurdles. The primary scientific contribution of this work is the design of scalable algorithms with mathematical guarantees to estimate (i) $t$-wise coverage for a given set of tests, and (ii) maximum $t$-wise coverage for a given set of constraints. In particular, we design a scalable framework ApproxCov that takes in a test set $\mathcal{U}$, a coverage parameter $t$, a tolerance parameter $\varepsilon$, and a confidence parameter $\delta$, and returns an estimate of the t-wise coverage of $\mathcal{U}$ that is guaranteed to be within ($1\pm \varepsilon$) -factor of the ground truth with probability at least $1-\delta$. We design a scalable framework ApproxMaxCov that, for a given formula $\mathsf{F}$, a coverage parameter $t$, a tolerance parameter $\varepsilon$, and a confidence parameter $\delta$, outputs an approximation which is guaranteed to be within ($1\pm\varepsilon$) factor of the maximum achievable $t$-wise coverage under $\mathsf{F}$, with probability $\geq 1-\delta$. Our comprehensive evaluation demonstrates that ApproxCov and ApproxMaxCov can handle benchmarks that are beyond the reach of current state-of-the-art approaches. We believe that the availability of ApproxCov and ApproxMaxCov will enable test suite designers to evaluate the effectiveness of their generators and thereby significantly impact the development of combinatorial testing techniques.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信