Consider the Hoare triple below. The variables x and y are inputs and p is the output. The postcondition expresses correctness of the program. fy > 0g i := 1; p := x; while ( i y ) i := i + 1; p := p * x; end fp = xyg (a) Using axiomatic semantics (Hoare logic), prove the Hoare triple above. (b) Give a brief argument (a few sentences at most) for why the loop terminates. (See the last page of the course notes on Axiomatic Semantics.)

Consider the Hoare triple below. The variables x and y are inputs and p is the output. The postcondition expresses correctness of the program. y> 0) while ( i y ) p:= p * x; end (a) Using axiomatic semantics (Hoare logic), prove the Hoare triple above (b) Give a brief argument (a few sentences at most) for why the loop terminates (See the last page of the course notes on Axiomatic Semantics.) Consider the Hoare triple below. The variables x and y are inputs and p is the output. The postcondition expresses correctness of the program. y> 0) while ( i y ) p:= p * x; end (a) Using axiomatic semantics (Hoare logic), prove the Hoare triple above (b) Give a brief argument (a few sentences at most) for why the loop terminates (See the last page of the course notes on Axiomatic Semantics.)