{"title":"测试c++类","authors":"I. Bashir, A. Goel","doi":"10.1109/STRQA.1994.526382","DOIUrl":null,"url":null,"abstract":"We present a semi-exhaustive approach to testing of a C++ class as a unit of testing. The general approach is outlined by an algorithm. This approach determines the correctness of a class by considering the manipulation of each of its data members by all possible sequences of member functions of the class. Member functions manipulating a data member are divided into different categories and each category is tested individually. A preliminary analysis of the algorithm determines the maximum number of test cases required for a given class.","PeriodicalId":125322,"journal":{"name":"Proceedings of 1994 1st International Conference on Software Testing, Reliability and Quality Assurance (STRQA'94)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Testing C++ classes\",\"authors\":\"I. Bashir, A. Goel\",\"doi\":\"10.1109/STRQA.1994.526382\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a semi-exhaustive approach to testing of a C++ class as a unit of testing. The general approach is outlined by an algorithm. This approach determines the correctness of a class by considering the manipulation of each of its data members by all possible sequences of member functions of the class. Member functions manipulating a data member are divided into different categories and each category is tested individually. A preliminary analysis of the algorithm determines the maximum number of test cases required for a given class.\",\"PeriodicalId\":125322,\"journal\":{\"name\":\"Proceedings of 1994 1st International Conference on Software Testing, Reliability and Quality Assurance (STRQA'94)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 1st International Conference on Software Testing, Reliability and Quality Assurance (STRQA'94)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/STRQA.1994.526382\",\"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 1994 1st International Conference on Software Testing, Reliability and Quality Assurance (STRQA'94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/STRQA.1994.526382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present a semi-exhaustive approach to testing of a C++ class as a unit of testing. The general approach is outlined by an algorithm. This approach determines the correctness of a class by considering the manipulation of each of its data members by all possible sequences of member functions of the class. Member functions manipulating a data member are divided into different categories and each category is tested individually. A preliminary analysis of the algorithm determines the maximum number of test cases required for a given class.