Explain the four criteria for proving the correctness of a logical pretest loop construct of the form "while B do S end". And prove the correctness of the following:

while B do S end

Check the explanation

Explanation:

The loop invariant has to satisfy some amount of requirements to be of good use. Another complex factor as to why a loop is the question of loop termination. A loop that doesn’t terminate can’t invariably be correct, and in fact the computation in whatever form amounts to nothing. The total axiomatic description of a while construct will have to involve all of the following to be true, in which I is the loop invariant:

P => I

{I and B} S {I}

(I and (not B)) => Q

Then the loop terminates

answer:

sure does

explanation:

angvrswer:

vfg

grfhrtrhr:

j

h

j

jjj

jj

j

j

j

m

j

h

yjujuju

jujuhuyhyt

j

hy

h

gh

g

g

g

g

gg

t

gt

gt

g

g

g

g

g

ef

f

d

dd

d

d

dd

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

d

f

s

bv

fb

c

fd

f

bf

bgf

n

g

bgr

gbr

bgr

gtr

bgr

gb

gb

gbgbbg

b

bgg

bbg

bfg

s

dcwf

fdb

b

ggb

bg

b

d

fh

d

e

f

w

fh

cd

cr

r

h

f

ww

a

v

f

vf

tr

rfe

rr

g

gg

e

go

d

d

c

r

rv

ng

gtg

gegte

g

gf

gf

g

gff

gf

gf

g

g

g

f

ds

wd

dfg

h

gfdsax

cvfbgnh

jmhngf

dsaazxscvb

nmhgb

fvdcsxaz

zxcv

bghn

fd

gb

h