Zero-one integer programming model in path selection problem of structural testing

[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference Pub Date : 1989-09-20 DOI:10.1109/CMPSAC.1989.65156

Jin-Cherng Lin, C. Chung

{"title":"Zero-one integer programming model in path selection problem of structural testing","authors":"Jin-Cherng Lin, C. Chung","doi":"10.1109/CMPSAC.1989.65156","DOIUrl":null,"url":null,"abstract":"A major issue in structural program testing is how to select a minimal set of test paths to meet certain test requirements. The zero-one integer programming model, a generalized optimal path selection method for node (or statement) testing and branch testing criteria, is extended in such a way that it can be used for DD-path testing, TER/sub n/ measurement, and all types of local coverage test criteria. With slight modification, it can also be applied to all types of data-flow-oriented test criteria. The model can be used for program testing based on any coverage criterion of the structural testing approach. If a mixture of multiple test criteria is needed, the model is still workable. The model can be applied to program testing with various objective functions and can be extended to multiple goal objective function problems. Since the objective functions are independent from the constraints of test criteria, it is possible to have various combinations of optimization criteria and coverage requirements according to the specified test strategy. Characteristics of the zero-one integer programming model are discussed.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1989.65156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

Abstract

A major issue in structural program testing is how to select a minimal set of test paths to meet certain test requirements. The zero-one integer programming model, a generalized optimal path selection method for node (or statement) testing and branch testing criteria, is extended in such a way that it can be used for DD-path testing, TER/sub n/ measurement, and all types of local coverage test criteria. With slight modification, it can also be applied to all types of data-flow-oriented test criteria. The model can be used for program testing based on any coverage criterion of the structural testing approach. If a mixture of multiple test criteria is needed, the model is still workable. The model can be applied to program testing with various objective functions and can be extended to multiple goal objective function problems. Since the objective functions are independent from the constraints of test criteria, it is possible to have various combinations of optimization criteria and coverage requirements according to the specified test strategy. Characteristics of the zero-one integer programming model are discussed.<>

查看原文本刊更多论文

结构测试路径选择问题中的0 - 1整数规划模型

结构程序测试中的一个主要问题是如何选择最小的测试路径集来满足特定的测试需求。0 - 1整数规划模型是节点(或语句)测试和分支测试准则的一种广义最优路径选择方法，对其进行了扩展，使其可用于dd路径测试、TER/sub /测量以及所有类型的局部覆盖测试准则。稍加修改，它还可以应用于所有类型的面向数据流的测试标准。该模型可用于基于结构测试方法的任何覆盖标准的程序测试。如果需要多个测试标准的混合，该模型仍然是可行的。该模型可应用于各种目标函数的程序测试，并可推广到多目标目标函数问题。由于目标函数独立于测试准则的约束，根据指定的测试策略，优化准则和覆盖需求可以有不同的组合。讨论了0 - 1整数规划模型的特点

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

求助全文

约1分钟内获得全文求助全文

来源期刊

[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference

自引率

0.00%

发文量