朝着更有效的方式生成测试用例:类图

Karl R. P. H. Leung, W. Wong
{"title":"朝着更有效的方式生成测试用例:类图","authors":"Karl R. P. H. Leung, W. Wong","doi":"10.1109/APAQ.2000.883802","DOIUrl":null,"url":null,"abstract":"Specifications are the primary source for obtaining test cases in software testing. Specification based testing is becoming more and more important when black box components and COTS are widely used in software development. One of these systematic approaches is deriving test cases from a classification tree. This approach partitions the input domain into classifications. Classifications are further partitioned into classes. Test cases are combinations of classes. Relations between classifications and classes are identified and are used to construct the classification tree. From the classification tree, a combination table is constructed. Test cases are derived from the combination table. However human decisions are required in determining whether test cases derived from the combination table are valid. This problem is incurred by the limitation of the expressive power and elegance of the two kinds of relations, namely classification classes and Class-Classification, that are allowed in the classification tree. We propose an enhancement of the classification tree by replacing the two kinds of relations by a Class-Class relation. We call this new approach Class Graphs. This paper describes the class graphs approach and compares its expressive power with the classification tree and show how test cases can be derived from class graph in a more efficient way.","PeriodicalId":432680,"journal":{"name":"Proceedings First Asia-Pacific Conference on Quality Software","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Towards a more efficient way of generating test cases: class graphs\",\"authors\":\"Karl R. P. H. Leung, W. Wong\",\"doi\":\"10.1109/APAQ.2000.883802\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Specifications are the primary source for obtaining test cases in software testing. Specification based testing is becoming more and more important when black box components and COTS are widely used in software development. One of these systematic approaches is deriving test cases from a classification tree. This approach partitions the input domain into classifications. Classifications are further partitioned into classes. Test cases are combinations of classes. Relations between classifications and classes are identified and are used to construct the classification tree. From the classification tree, a combination table is constructed. Test cases are derived from the combination table. However human decisions are required in determining whether test cases derived from the combination table are valid. This problem is incurred by the limitation of the expressive power and elegance of the two kinds of relations, namely classification classes and Class-Classification, that are allowed in the classification tree. We propose an enhancement of the classification tree by replacing the two kinds of relations by a Class-Class relation. We call this new approach Class Graphs. This paper describes the class graphs approach and compares its expressive power with the classification tree and show how test cases can be derived from class graph in a more efficient way.\",\"PeriodicalId\":432680,\"journal\":{\"name\":\"Proceedings First Asia-Pacific Conference on Quality Software\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"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.883802\",\"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.883802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

规格说明是软件测试中获得测试用例的主要来源。随着黑盒组件和COTS在软件开发中的广泛应用,基于规范的测试变得越来越重要。这些系统方法之一是从分类树中派生测试用例。这种方法将输入域划分为不同的类别。分类进一步划分为类。测试用例是类的组合。识别分类和类之间的关系,并用于构建分类树。从分类树中,构造一个组合表。测试用例是从组合表派生出来的。然而,在确定从组合表派生的测试用例是否有效时,需要人工决策。这一问题的产生是由于分类树所允许的两种关系(分类类和类分类)的表达能力和优雅性受到限制。我们提出用类-类关系代替这两种关系来增强分类树。我们称这种新方法为类图。本文描述了类图方法,并将其与分类树的表达能力进行了比较,说明了如何更有效地从类图中派生出测试用例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards a more efficient way of generating test cases: class graphs
Specifications are the primary source for obtaining test cases in software testing. Specification based testing is becoming more and more important when black box components and COTS are widely used in software development. One of these systematic approaches is deriving test cases from a classification tree. This approach partitions the input domain into classifications. Classifications are further partitioned into classes. Test cases are combinations of classes. Relations between classifications and classes are identified and are used to construct the classification tree. From the classification tree, a combination table is constructed. Test cases are derived from the combination table. However human decisions are required in determining whether test cases derived from the combination table are valid. This problem is incurred by the limitation of the expressive power and elegance of the two kinds of relations, namely classification classes and Class-Classification, that are allowed in the classification tree. We propose an enhancement of the classification tree by replacing the two kinds of relations by a Class-Class relation. We call this new approach Class Graphs. This paper describes the class graphs approach and compares its expressive power with the classification tree and show how test cases can be derived from class graph in a more efficient way.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信