利用计算学习理论分析程序段的测试复杂度

Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93 Pub Date : 1993-11-01 DOI:10.1109/CMPSAC.1993.404242

K. Romanik, J. Vitter

{"title":"利用计算学习理论分析程序段的测试复杂度","authors":"K. Romanik, J. Vitter","doi":"10.1109/CMPSAC.1993.404242","DOIUrl":null,"url":null,"abstract":"We examine the complexity of testing different program constructs by defining a measure called VCP-dimension and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine approximate correctness, so it gives insight into the difficulty of testing a program construct represented by a program class. We investigate the VCP-dimension of straight line code, if-then-else statements and for loops, and we compare the VCP-dimension of different combinations of constructs.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Using computational learning theory to analyze the testing complexity of program segments\",\"authors\":\"K. Romanik, J. Vitter\",\"doi\":\"10.1109/CMPSAC.1993.404242\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We examine the complexity of testing different program constructs by defining a measure called VCP-dimension and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine approximate correctness, so it gives insight into the difficulty of testing a program construct represented by a program class. We investigate the VCP-dimension of straight line code, if-then-else statements and for loops, and we compare the VCP-dimension of different combinations of constructs.<<ETX>>\",\"PeriodicalId\":375808,\"journal\":{\"name\":\"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1993.404242\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1993.404242","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们通过定义称为vcp维的度量并将其应用于程序类来检查测试不同程序结构的复杂性，其中类中的所有程序共享相同的语法结构。VCP-dimension给出了确定近似正确性所需的测试点数量的界限，因此它可以深入了解测试由程序类表示的程序结构的难度。我们研究了直线代码、if-then-else语句和for循环的vcp维数，并比较了不同结构组合的vcp维数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Using computational learning theory to analyze the testing complexity of program segments

We examine the complexity of testing different program constructs by defining a measure called VCP-dimension and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine approximate correctness, so it gives insight into the difficulty of testing a program construct represented by a program class. We investigate the VCP-dimension of straight line code, if-then-else statements and for loops, and we compare the VCP-dimension of different combinations of constructs.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93

自引率

0.00%

发文量