{"title":"基于决策树的突变检测方法","authors":"Reena, Jyotiprakash Choudhary","doi":"10.1109/CICN.2014.245","DOIUrl":null,"url":null,"abstract":"Mutation Testing is one of the most supportive black-box testing approaches that performs the operator based analysis over the program statements to analyze the impact of work. In this work, a decision tree based work is defined to generate the possible mutation for a java program. The decision tree is here defined to reduce the test cases so that the efficiency over the operator check will be obtained. The work is here defined for both the traditional as well as class operators. The obtained results from the system shows the effective generation of test cases.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"27 1","pages":"1173-1176"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Decision-Tree Based Approach for Mutation Testing\",\"authors\":\"Reena, Jyotiprakash Choudhary\",\"doi\":\"10.1109/CICN.2014.245\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mutation Testing is one of the most supportive black-box testing approaches that performs the operator based analysis over the program statements to analyze the impact of work. In this work, a decision tree based work is defined to generate the possible mutation for a java program. The decision tree is here defined to reduce the test cases so that the efficiency over the operator check will be obtained. The work is here defined for both the traditional as well as class operators. The obtained results from the system shows the effective generation of test cases.\",\"PeriodicalId\":6487,\"journal\":{\"name\":\"2014 International Conference on Computational Intelligence and Communication Networks\",\"volume\":\"27 1\",\"pages\":\"1173-1176\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Computational Intelligence and Communication Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICN.2014.245\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Computational Intelligence and Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2014.245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Decision-Tree Based Approach for Mutation Testing
Mutation Testing is one of the most supportive black-box testing approaches that performs the operator based analysis over the program statements to analyze the impact of work. In this work, a decision tree based work is defined to generate the possible mutation for a java program. The decision tree is here defined to reduce the test cases so that the efficiency over the operator check will be obtained. The work is here defined for both the traditional as well as class operators. The obtained results from the system shows the effective generation of test cases.