Viggnesh_kandasamy_001

Viggnesh_kandasamy_001 - a<=b<=c<=d } Sol Let

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Q)Prove partial correctness Note: you must find the invariant – prove invariant correctness only for one guard. {true} (a,b,c,d) :=(A,B,C,D); loopselect a > b => swap(a, b) or b > c => swap(b, c) or c >d => swap(c, d) end loopselect; {(a,b,c,d)=permutation(A,B,C,D) and
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a<=b<=c<=d } Sol Let {(a1,b1,c1,d1):=(a,b,c,d)} be the invariant after the loopselect statement and {(a2,b2,c2,d2):=(a,b,c,d) be the invariant exactly before the end loopselect statement....
View Full Document

This note was uploaded on 05/04/2011 for the course CS 536 taught by Professor Cs536 during the Spring '08 term at Illinois Tech.

Page1 / 2

Viggnesh_kandasamy_001 - a<=b<=c<=d } Sol Let

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online