5. Compute the weakest precondition for each of the following assignment statements and postconditions: a. a...

 

Transcribed Image Text:

5. Compute the weakest precondition for each of the following assignment statements and postconditions: a. a a+2 b 1 {a> 1} b. x 2y+x-1 {x > 11} c. a = 2* b + 1; b a 3 {b <0} d. if (x > y) else y=2x+1 y=3*x-1; {y>3} 6. Write a brief analysis of the following semantics techniques: Attribute Grammars, operational semantics, denotational semantics 7. Prove the following program is correct: {n>0} count = n; sum = 0; while count 0 do end sum = sum + count; count = count - 1; = {sum 1+2+...+n} 5. Compute the weakest precondition for each of the following assignment statements and postconditions: a. a a+2 b 1 {a> 1} b. x 2y+x-1 {x > 11} c. a = 2* b + 1; b a 3 {b <0} d. if (x > y) else y=2x+1 y=3*x-1; {y>3} 6. Write a brief analysis of the following semantics techniques: Attribute Grammars, operational semantics, denotational semantics 7. Prove the following program is correct: {n>0} count = n; sum = 0; while count 0 do end sum = sum + count; count = count - 1; = {sum 1+2+...+n}

Answer rating: 100% (QA)

5 Weakest Precondition a a 2b 1 a 1 Weakest Precondition a 1 Rightarrow a 2b 1 1 So the weakest precondition is a 2b 2 b x 2y x 1 x 11 Weakest Precond... View the full answer