{"title":"原子算术表达式测试用例的完备性","authors":"T. H. Tse, Xin Feng, T. Chen","doi":"10.1109/APAQ.2000.883788","DOIUrl":null,"url":null,"abstract":"Most research on weak mutation testing focuses on predicate statements. Relative little attention has been paid to arithmetic expressions. In this paper we analyse the latter type of expression and prove that, given an atomic arithmetic expression, if it contains no variable or if the operator is the unary \"++\" or \"--\", then a single test case is sufficient and necessary to kill any fundamental mutant; otherwise, two test cases are sufficient and necessary.","PeriodicalId":432680,"journal":{"name":"Proceedings First Asia-Pacific Conference on Quality Software","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the completeness of test cases for atomic arithmetic expressions\",\"authors\":\"T. H. Tse, Xin Feng, T. Chen\",\"doi\":\"10.1109/APAQ.2000.883788\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most research on weak mutation testing focuses on predicate statements. Relative little attention has been paid to arithmetic expressions. In this paper we analyse the latter type of expression and prove that, given an atomic arithmetic expression, if it contains no variable or if the operator is the unary \\\"++\\\" or \\\"--\\\", then a single test case is sufficient and necessary to kill any fundamental mutant; otherwise, two test cases are sufficient and necessary.\",\"PeriodicalId\":432680,\"journal\":{\"name\":\"Proceedings First Asia-Pacific Conference on Quality Software\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings First Asia-Pacific Conference on Quality Software\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APAQ.2000.883788\",\"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 First Asia-Pacific Conference on Quality Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APAQ.2000.883788","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the completeness of test cases for atomic arithmetic expressions
Most research on weak mutation testing focuses on predicate statements. Relative little attention has been paid to arithmetic expressions. In this paper we analyse the latter type of expression and prove that, given an atomic arithmetic expression, if it contains no variable or if the operator is the unary "++" or "--", then a single test case is sufficient and necessary to kill any fundamental mutant; otherwise, two test cases are sufficient and necessary.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
