测试c++类

I. Bashir, A. Goel
{"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}
引用次数: 10

摘要

我们提出了一种半详尽的方法来测试作为测试单元的c++类。一般的方法是由一个算法概述。这种方法通过考虑类的所有可能的成员函数序列对其每个数据成员的操作来确定类的正确性。操作数据成员的成员函数分为不同的类别,每个类别都单独进行测试。算法的初步分析确定了给定类所需的测试用例的最大数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Testing C++ classes
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信