How could you make a proof for
SUBROUTINE COMP(X,Y:Z)
Z <- X
W <- Y
While(W > 0)
a. Z <- Z+Y
b. W <- W - 1
Return
END OF SUBROUTINE DIFF
COMPUTES: Z = X + Y^2
LOOP INVARIANT: (Y + W) + Z = X + Y^2
All variables represent non negative integers.
How to prove pseudocode using mathematical induction?
0
$\begingroup$
discrete-mathematics
-
1what are we proving here? – 2017-02-08
-
0Proving the relationship indicated as a loop invariant – 2017-02-08
-
0Difficult, since $X-Y$ is clearly not what it computes. – 2017-02-08
-
0Wow, I made a typo, my bad. – 2017-02-08