第三讲—软件测试的方法.pptVIP

2. Determine the cyclomatic complexity of the resultant flow graph Note: can be determined without developing a flow graph count all conditional statements in a component ? compound conditions count as 2 (number of Boolean operators + 2) 3. Determine a basis set of linearly independent paths equal to cyclomatic complexity number identify predicate nodes as an aid in derivation of test cases 4. Prepare test cases that will force execution of each path in the basis set each test case is executed and compared to the expected result this process can be mechanized 状态迁移图 状态迁移图，描述系统状态变化