1 / 67

Functional Verification III

Functional Verification III. Software Testing and Verification Lecture Notes 23. Prepared by Stephen M. Thebaut, Ph.D. University of Florida. Previously…. Correctness conditions and working correctness questions: sequencing decision statements. Today’s Topics.

arien
Download Presentation

Functional Verification III

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Functional Verification III Software Testing and Verification Lecture Notes 23 Prepared by Stephen M. Thebaut, Ph.D. University of Florida

  2. Previously… • Correctness conditions and working correctness questions: • sequencing • decision statements

  3. Today’s Topics • Iteration Recursion Lemma (IRL) • Termination predicate: term(f,P) • Correctness conditions for while_do statement • Sufficient correctness conditions • Correctness conditions for repeat_until statement • Subgoal Induction

  4. Iteration Recursion Lemma (IRL) • The IRL reduces the verification of programs with loops to a question of termination and the verification of loop-free programs by converting iteration to recursion. • For while loops, the Lemma states: f = [while p do g] = [if p then g;f end_if] (note recursion)

  5. Iteration Recursion Lemma (cont’d) F p T F F F p p p g f = = = = T T T g g;f g F p T f g

  6. Iteration Recursion Lemma (cont’d) • Rather than verify directly that f is the program function of K = while p do g which can be very difficult, it is sufficient to prove that 1. K terminates for all X D(f), and that 2. f is the program function of Q = if p then g;f end_if because [K] = [Q].

  7. An important implication of the IRL • Suppose for “input” X0 the while loop term-inates after n iterations with “output” Xn. • Furthermore, let X1, X2, ..., Xn-1 be the in-termediate states generated by the loop. • Then  0≤i<n, we know: • p(Xi), • Xi+1=g(Xi), and • ¬p(Xn).

  8. An important implication of the IRL (cont’d) • As f= [while p do g]= [if p then g;fend_if], it follows that f(X0) = f(X1) = ... = f(Xn) = Xn • More generally, after each iteration of the loop, the function value of the current state, X, must be the same as the function value of the initial state, X0. That is: f(X) = f(X0) • We will revisit this observation in connection with Mill’s Invariant Status Theorem later.

  9. Illustrative Example of IRL • To further illustrate the fact that [while p do g] = [if p then g;f end_if] consider a concrete example... • Let K = while y>0 do x,y := x+1,y−1 • Claim: Kis function equivalent to Q = if y>0 then x,y := x+1,y−1;k end_if where, by definition, k = [K]. g p p k o g

  10. Illustrative Example of IRL (cont’d) Case (y>0): For K = while y>0 do x,y := x+1,y−1, the loop body executes y times before the predicate y>0 becomes false. By observation, then, the final value of x is x0+(1)y0 = x0+y0 and the final value of y is 0. Thus, (y>0) => k = (x,y := x+y,0) Also, note that when y=0 initially, k = I = (x,y := x,y) = (x,y := x+0,y) = (x,y := x+y,0) Therefore, (y≥0) => k = (x,y := x+y,0)

  11. Illustrative Example of IRL (cont’d) Case (y>0): (cont’d) [Q] is a composition of two functions, i.e., k o g, and may be determined by direct substitution. For y>0 initially, y will be greater than OR EQUAL to 0 after executing the loop body, but since we know (y≥0) => k = (x,y := x+y,0), we have [Q] = (x,y := x+y,0) o (x,y := x+1,y−1) = (x,y := (x+1)+(y−1),0) = (x,y := x+y,0) = k (the function computed by K) Thus, [Q] = [K] when y>0.

  12. Illustrative Example of IRL (cont’d) Case (y≤0): Since the predicate (y>0) fails, both K and Q do nothing, and are therefore equivalent. Thus, [Q] = I = [K] when y≤0. Therefore,K is function equivalent to Q.

  13. Termination Predicate • The correctness of a looping program P depends, in part, on termination. • Consideration is limited to programs whose termination can be established and the following predicate is defined: term(f,P) ‘‘P terminates for every initial state X D(f)’’

  14. Before we continue… • Take out a piece of paper and a pen/pencil. • Without looking back in the lecture notes, write down the complete correctness con-ditionsfor: f = [if p then g]

  15. if_then Correctness Conditions • Complete correctness conditions for f = [if p then g]: Prove: p (f = g) Л ¬p (f = I) • So, aside from proving termination over the domain of f, what are the two corresponding conditions for: f = [while p do g] = [if p then fog] ?

  16. while_do Correctness Conditions • Complete correctness conditions for f = [K] = [while p do G] (where g = [G] has already been shown): Prove: term(f,K)Л p (f = f o g) Л ¬p(f = I)

  17. while_do Correctness Conditions (cont’d) • Working correctness questions: • Is loop termination guaranteed for any argument of f ? • When p is true does f equal f composed with g? • When p is false does f equal Identity?

  18. while_do Example • Prove f = [T] where, for integers x, y, and z: f = (y≥0  z,y := z+xy,0) and T is: while y<>0 do z := z+x y := y−1 end_while p G

  19. while_do Example (cont’d) • Proof: g = [G] = (z,y := z+x,y−1) by observation • term(f,T)? f = (y≥0  z,y := z+xy,0) and T is: while y<>0 do z := z+x y := y−1 end_while So, does y≥0 initially  T will terminate?

  20. while_do Example (cont’d) • Proof: g = [G] = (z,y := z+x,y−1) by observation • term(f,T)?√ (Prove this…)

  21. while_do Example (cont’d) • Proof: g = [G] = (z,y := z+x,y−1) by observation • term(f,T)?√ (Prove this…) • Does (y=0)  ( f = I )? ¬p ( Recall: f = (y≥0 z,y := z+xy,0) )

  22. while_do Example (cont’d) • Proof: g = [G] = (z,y := z+x,y−1) by observation • term(f,T)?√ (Prove this…) • Does (y=0)  ( f = I )? √ (y=0)  ( f = (z,y := z+x(0),0) = (z,y := z,0) ) (y=0)  ( I = (z,y := z,0) )

  23. while_do Example (cont’d) • Does (y0)  ( f = f o g )? p

  24. while_do Example (cont’d) • Does (y0)  ( f = f o g )? case a: Does (y<0)  ( f = f o g )? (y<0)  ( f = undefined ) (y<0)  ( f o g = f o (z,y := z+x,y−1) What is f when appliedafterg decrements the initially negative value of y? ( Recall: f = (y≥0 z,y := z+xy,0) )

  25. while_do Example (cont’d) • Does (y0)  ( f = f o g )? case a: Does (y<0)  ( f = f o g )? (y<0)  ( f = undefined ) (y<0)  ( f o g = undefinedo (z,y := z+x,y−1) since y<0 gy(y<0)<0 ( Recall: f = (y≥0 z,y := z+xy,0) )

  26. while_do Example (cont’d) • Does (y0)  ( f = f o g )? case a: Does (y<0)  ( f = f o g )? (y<0)  ( f = undefined ) (y<0)  ( f o g = undefined o (z,y := z+x,y−1) = undefined )

  27. while_do Example (cont’d) • Does (y0)  ( f = f o g )? case a: Does (y<0)  ( f = f o g )? √ (y<0)  ( f = undefined) (y<0)  ( f o g = undefined o (z,y := z+x,y−1) = undefined)

  28. while_do Example (cont’d) • Does (y0)  ( f = f o g )? case b: Does (y>0)  ( f = f o g )? ( Recall: f = (y≥0 z,y := z+xy,0) )

  29. while_do Example (cont’d) • Does (y0)  ( f = f o g )? case b: Does (y>0)  ( f = f o g )? (y>0)  ( f = (z,y := z+xy,0)) (y>0)  ( f o g = f o (z,y := z+x,y−1) Again, what is f when appliedafterg decrements the initially positive value of y? ( Recall: f = (y≥0 z,y := z+xy,0) )

  30. while_do Example (cont’d) • Does (y0)  ( f = f o g )? case b: Does (y>0)  ( f = f o g )? (y>0)  ( f = (z,y := z+xy,0)) (y>0)  ( f o g = (z,y := z+xy,0)o (z,y := z+x,y−1) since y>0 gy(y>0)≥0 ( Recall: f = (y≥0 z,y := z+xy,0) )

  31. while_do Example (cont’d) • Does (y0)  ( f = f o g )? case b: Does (y>0)  ( f = f o g )? (y>0)  ( f = (z,y := z+xy,0)) (y>0)  ( f o g = (z,y := z+xy,0)o (z,y := z+x,y−1) = (z,y := (z+x)+x(y−1),0) = (z,y := z+xy,0) )

  32. while_do Example (cont’d) • Does (y0)  ( f = f o g )? case b: Does (y>0)  ( f = f o g )? (y>0)  ( f = (z,y := z+xy,0)) (y>0)  ( f o g = (z,y := z+xy,0)o (z,y := z+x,y−1) = (z,y := (z+x)+x(y−1),0) = (z,y := z+xy,0) ) We could have also composed the full, conditional definition of f with g, i.e. (y≥0 z,y := z+xy,0) o (z,y := z+x,y−1) to yield (y≥1 z,y := z+xy,0) which is just (z,y := z+xy,0) when y>0.

  33. while_do Example (cont’d) • Does (y0)  ( f = f o g )? √ case b: Does (y>0)  ( f = f o g )? √ (y>0)  ( f = (z,y := z+xy,0) ) (y>0)  ( f o g = (z,y := z+xy,0)o (z,y := z+x,y−1) = (z,y := (z+x)+x(y−1),0) = (z,y := z+xy,0) ) Therefore, f = [T].

  34. Exercise 1 • For program M below, where all variables are integers, hypothesize a function f for [M] and prove f = [M]. while i<n do t := t*x i := i+1 end_while

  35. Sufficient Correctness Conditions • Given the complete correctness conditions for f = [H] = [while p do g]: Prove: term(f,H)Л p (f = f o g) Л ¬p(f = I)

  36. Sufficient Correctness Conditions (cont’d) What are the sufficient correctnessconditions for f  [H] = [while p do g]? Prove: f’ = [H]for some f’Л ff’

  37. Sufficient Correctness Conditions (cont’d) What are the sufficient correctnessconditions for f  [H] (for ANY program, H)? Prove: f’ = [H]for some f’Л ff’

  38. repeat_until Statement • What are the complete correctness conditions for f = [R] = [repeat g until p]? g f = T p F

  39. repeat_until Statement (cont’d) • An IRL for repeat_until statements: f = [repeat g until p] = [g; if ¬p then f]

  40. “Proof” by Picture g g g g T T = f = = = F p p ¬p T p F F T g F f f T p F

  41. repeat_until Statement (cont’d) • Therefore, it is sufficient to verify that 1. R terminates for all X D(f), and that 2. f is the program function of Q = g; if ¬p then f end_if because [R] = [Q].

  42. repeat_until Correctness Conditions • Complete correctness conditions for f = [R] = [repeat G until p] (where g = [G] has already been shown): Prove: term(f,R)Л (p o g) (f = g) Л ¬(p o g)(f = f o g)

  43. repeat_until Correctness Conditions (cont’d) • Working correctness questions: • Is loop termination guaranteed for any argument of f ? • When p o g is true does f equal g? • When p o g is false does f equal f o g?

  44. Exercise 2 • For program R below, where all variables are integers, hypothesize a function r for [R] and prove r = [R]. repeat: x := x−1 y := y+2 until x=0

  45. Subgoal Induction • “Subgoal induction” is a proof method pro-posed by Morris and Wegbreit† that can be viewed as a generalization of (while loop) functional verification. • It uses a variation of the Iteration Recursion Lemma (IRL) to identify relatively simple correctness conditions for a while loop surrounded by pre- and post-processing code. †Morris, James & Ben Wegbreit, “Subgoal Induction,” CACM, Volume 20, No. 4, April 1977.

  46. Subgoal Induction (cont’d) • The key observation underlying the method is: v = [while p do g end_while; t] ≡ [if p then g;velse tend_if_else] • The function equivalence of these programs, like that asserted in the IRL, is perhaps best illustrated graphically...

  47. Subgoal Induction (cont’d) F p T F F F p p p g t v = = = = T T T g;v g g t t t F p T v g t

  48. Subgoal Induction (cont’d) • Suppose, now, that compound program K is: h; while p do g end_while; t and that v= [while p do g end_while; t]. • From the functional equivalence illustrated aboveandthe fact that K = h;v,it therefore follows that: [K] = voh =[if p then g;velse tend_if_else]oh

  49. Subgoal Induction (cont’d) • Recall the complete correctness conditions for r = [if p then g else t]: (1) p  (r=g) and(2) ¬p  (r=t). • Thus, the complete correctness conditions for f = [K] = [h; while p do g end_while; t] are: (1) term(f,K), (2) p  (v=vog), (3) ¬p (v=t), and (4) f=voh wherev = [while p do g end_while; t].

  50. Subgoal induction vs. functional verification • How does subgoal induction differ from the program decomposition strategy employed in functional verification? To show f = [h; while p do g end_while; t] using functional verification, an intermediate hypothesis and “sub-proof” for the loop is required, whereas tis part of the intermediate hypothesisin the subgoal induction case. • Note that if t is the identify function, the two strategies are identical.

More Related