对修正条件/ 判定覆盖方法测试集个数的分析

赵　瑾1 ,2 , 高建华1 I$zzT  
(11 上海师范大学数理信息学院,上海200234 ; H<Q{-r   
21 东华理工学院计算机科学与通讯系,江西抚州344000) F"}w!&cQ  
摘　要:修正条件/ 判定覆盖(MC/ DC) 是软件测试方法之一。文中通过介绍MC/ DC 这种测试方法推导出一个关于任意一个布尔表达式其测试集个数的问题的结论。首先从介绍这种测试方法的定义及如何寻找其测试集的方法开始出发;其次推导出关于测试集个数的结论,并加以理论证明;最后以一些实例来说明此结论。 !&Ar"fM \w  
关键词:MC/ DC;个数;元素;测试集 n$0$ 43f  
中图分类号: TP311. 5 　　　　　　　文献标识码:A 　　　　　　文章编号:1005 - 3751 (2005) 10 - 0110 - 03

Analyzing Number of Test Sets for Modified

Condition/ Decision Coverage C%0Z
At 2  
ZHAO J in1 ,2 , GAO J ian2hua1 W/-#>&  
(1. Mathematical and Science College , Shanghai Normal University , Shanghai 200234 ,China ; `UqRF.6  
2. Department of Computer Science and Communication , Donghua Institute of Sciences , Fuzhou 344000 ,China) m/8_R?U   
Abstract :Modified Condition/ Decision Coverage (MC/ DC) is the one of the software testing ways. The aim of this paper is to conclude a conclusion which relates to the number of the Boolean expression’s testing sets , through introducing the way of MC/ DC. Firstly introduce the definition of MC/ DC and the way to find the testing sets , then derive the conclusion and prove it , at last some examples are used to explain the conclusion. u f#Ii|u  
Key words :MC/ DC; number ; element ; test sets