Algorithm of minimum test case set generation using matrix recursion
The algorithm of minimum test case set conforming to MC/DC criterion has important practical value.Firstly,the Boolean expression is transformed into a syntax binary tree,and then the matrix combinational logic operation is used to recurse layer by layer to obtain a complete set of MC/DC minimum tes...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
National Computer System Engineering Research Institute of China
2020-04-01
|
| Series: | Dianzi Jishu Yingyong |
| Subjects: | |
| Online Access: | http://www.chinaaet.com/article/3000117763 |
| Summary: | The algorithm of minimum test case set conforming to MC/DC criterion has important practical value.Firstly,the Boolean expression is transformed into a syntax binary tree,and then the matrix combinational logic operation is used to recurse layer by layer to obtain a complete set of MC/DC minimum test cases.It is proved that the method of matrix combinational logic operation is reasonable and correct.The method can quickly obtain complete MC/DC minimum test case set for nontrivial Boolean expressions,and can also deal with complex Boolean expressions with coupling conditions. |
|---|---|
| ISSN: | 0258-7998 |