个人软件过程 L9 Design verification.ppt

* * * * * * * * * * * * * * * * * * * * * * * * Trace Table Example: Cycle T Cycle T: L = 1, N = 2, T = T ClearSpaces(var Input: string; State: int) # 1 2 3 4 5 6 Instructions Condition Input Length State Length := length(Input)State := 0 repeat if Input[Length-1] = ‘ ‘ Length := Length - 1 false if State 2 State:=State+1 else State := 3 until State=3 or Length=0 true 3 ‘ AB…’ 3 2 7 Verifying Program Correctness Correctness verification methods treat programs as mathematical theorems. These methods are particularly useful during design and design review. Because program verification often involves sophisticated reasoning, it is important to check your work carefully. Correctness Verification To verify a program identify all of the program cases consider each verification question while reviewing each non-trivial construct where the answer is not obvious, use a trace table to evaluate the conditions that the program must satisfy While this verification approach works with most design constructs, only “while loops” are described in this lecture. Proofs for repeat-until and for-loops are described in the textbook (pages 301 – 308). WhileLoop Verification -1 The WhileLoop is assumed to have the following form. WhileLoop Verification -2 A while-loop is correct if all of the following questions can be answered with “yes.” Question 1: Is loop termination guaranteed for any argument of WhileTest? Question 2: When WhileTest is true, does WhileLoop = LoopPart followed by WhileLoop? Question 3: When WhileTest is false, does WhileLoop = identity? WhileLoop Example -1 Assuming n 0, calculate n! WhileLoop Example -2 Question 1: Is loop termination guaranteed for any argument of WhileTest? Yes, the loop terminates when i = n. Since i steps inside the loop, it will terminate as long as n 0. Question 2: When WhileTest is true, is WhileLoop = LoopPart followed by WhileLoop? Yes, the LoopPart increments i and sets f equal to f * i, so