{"title":"一种有效的测试套件缩减方法","authors":"Pan Liu","doi":"10.1109/SNPD.2014.6888743","DOIUrl":null,"url":null,"abstract":"The paper presents a novel reduction approach to test suite in regression testing. Our approach selects a test case from those redundant test cases with the same rank according to the boundary coverage taken as second coverage criterion. Different from the previous researches for the selection of the second coverage criterion to assist test suite reduction, our approach bases on our empirical point of view that some faults in the program lie on its boundary of the program. Therefore test cases picked by our approach have the higher probability to find software errors. An algorithm is proposed to realize our approach. In addition, we also discuss the relationship between our approach with three traditional heuristics. Through a simple exampke, we illustrate our algorithm for test suite reduction.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An efficient reduction approach to test suite\",\"authors\":\"Pan Liu\",\"doi\":\"10.1109/SNPD.2014.6888743\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents a novel reduction approach to test suite in regression testing. Our approach selects a test case from those redundant test cases with the same rank according to the boundary coverage taken as second coverage criterion. Different from the previous researches for the selection of the second coverage criterion to assist test suite reduction, our approach bases on our empirical point of view that some faults in the program lie on its boundary of the program. Therefore test cases picked by our approach have the higher probability to find software errors. An algorithm is proposed to realize our approach. In addition, we also discuss the relationship between our approach with three traditional heuristics. Through a simple exampke, we illustrate our algorithm for test suite reduction.\",\"PeriodicalId\":272932,\"journal\":{\"name\":\"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2014.6888743\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2014.6888743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The paper presents a novel reduction approach to test suite in regression testing. Our approach selects a test case from those redundant test cases with the same rank according to the boundary coverage taken as second coverage criterion. Different from the previous researches for the selection of the second coverage criterion to assist test suite reduction, our approach bases on our empirical point of view that some faults in the program lie on its boundary of the program. Therefore test cases picked by our approach have the higher probability to find software errors. An algorithm is proposed to realize our approach. In addition, we also discuss the relationship between our approach with three traditional heuristics. Through a simple exampke, we illustrate our algorithm for test suite reduction.