覆盖阵列的实用存档和压缩

Manuel Leithner, D. Simos
{"title":"覆盖阵列的实用存档和压缩","authors":"Manuel Leithner, D. Simos","doi":"10.1109/ICSTW55395.2022.00024","DOIUrl":null,"url":null,"abstract":"Covering arrays (CAs) are combinatorial structures that play a significant role in software testing. While a sizable body of research has been dedicated to the generation of CAs, virtually no attention has been directed to their efficient storage, archival, and retrieval. Considering the potential economic advantages offered by the use of these structures, this is surprising: While the algorithmic complexity of most known methods used in their construction tends to be high, leading to expensive computations, the cost of storage has decreased in recent years. It thus seems prudent to identify and tackle the practical issues of large-scale and long-term archival and compression of such objects. This paper introduces CA2, the Compressed Covering Array Archive format, which offers competitive compression combined with CA-specific metadata that allows for targeted retrieval based on input specifications given in one of a variety of popular formats. An open source prototype implementation is provided as a utility for practitioners and building block for future research.","PeriodicalId":147133,"journal":{"name":"2022 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CA2: Practical Archival and Compression of Covering Arrays\",\"authors\":\"Manuel Leithner, D. Simos\",\"doi\":\"10.1109/ICSTW55395.2022.00024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Covering arrays (CAs) are combinatorial structures that play a significant role in software testing. While a sizable body of research has been dedicated to the generation of CAs, virtually no attention has been directed to their efficient storage, archival, and retrieval. Considering the potential economic advantages offered by the use of these structures, this is surprising: While the algorithmic complexity of most known methods used in their construction tends to be high, leading to expensive computations, the cost of storage has decreased in recent years. It thus seems prudent to identify and tackle the practical issues of large-scale and long-term archival and compression of such objects. This paper introduces CA2, the Compressed Covering Array Archive format, which offers competitive compression combined with CA-specific metadata that allows for targeted retrieval based on input specifications given in one of a variety of popular formats. An open source prototype implementation is provided as a utility for practitioners and building block for future research.\",\"PeriodicalId\":147133,\"journal\":{\"name\":\"2022 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSTW55395.2022.00024\",\"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 International Conference on Software Testing, Verification and Validation Workshops (ICSTW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTW55395.2022.00024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

覆盖阵列(ca)是在软件测试中扮演重要角色的组合结构。虽然大量的研究致力于证书的生成,但实际上没有人关注它们的有效存储、存档和检索。考虑到使用这些结构所提供的潜在经济优势,这是令人惊讶的:虽然大多数已知方法在其构造中使用的算法复杂性往往很高,导致昂贵的计算,但近年来存储成本有所下降。因此,确定和解决大规模和长期存档和压缩这些对象的实际问题似乎是谨慎的。本文介绍了CA2,即压缩覆盖阵列归档格式,它提供了与ca特定元数据相结合的竞争性压缩,允许基于以各种流行格式之一给出的输入规范进行目标检索。提供了一个开源的原型实现,作为实践者的实用工具和未来研究的构建块。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CA2: Practical Archival and Compression of Covering Arrays
Covering arrays (CAs) are combinatorial structures that play a significant role in software testing. While a sizable body of research has been dedicated to the generation of CAs, virtually no attention has been directed to their efficient storage, archival, and retrieval. Considering the potential economic advantages offered by the use of these structures, this is surprising: While the algorithmic complexity of most known methods used in their construction tends to be high, leading to expensive computations, the cost of storage has decreased in recent years. It thus seems prudent to identify and tackle the practical issues of large-scale and long-term archival and compression of such objects. This paper introduces CA2, the Compressed Covering Array Archive format, which offers competitive compression combined with CA-specific metadata that allows for targeted retrieval based on input specifications given in one of a variety of popular formats. An open source prototype implementation is provided as a utility for practitioners and building block for future research.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信