Find the loop invariant, variant and weakest pre-condition in the following function. Prove total correctness of...

  

Transcribed Image Text:

Find the loop invariant, variant and weakest pre-condition in the following function. Prove total correctness of this function. What do you think this function is computing. int funl (int x) { int y = 1; int z = x; while (z > 0) { y = y N = N * - z; 1; } return y; Find the loop invariant, variant and weakest pre-condition in the following function. Prove total correctness of this function. What do you think this function is computing. int funl (int x) { int y = 1; int z = x; while (z > 0) { y = y N = N * - z; 1; } return y;

Answer rating: 100% (QA)

To analyze the function provided 1 Loop Invariant The loop invariant is a condition that holds true ... View the full answer