X hits on this document

Powerpoint document

Algorithmic Verification of Concurrent Programs - page 9 / 100

226 views

0 shares

0 downloads

0 comments

9 / 100

{true}

i = 0

{0 <= i && i <= a.length  && forall j:int :: 0 <= j && j < i ==> a[j] != n}

{0 <= i && i <= a.length  && forall j:int :: 0 <= j && j < i ==> a[j] != n}

assume i < a.length;

assume !(a[i] == n);

i++;

{0 <= i && i <= a.length  && forall j:int :: 0 <= j && j < i ==> a[j] != n}

{0 <= i && i <= a.length  && forall j:int :: 0 <= j && j < i ==> a[j] != n}

assume i < a.length;

assume (a[i] == n);

{(i >= 0 > a[&& (< 0   ==> <= j && j < > a[j] != n)}

{0 <= i && i <= a.length  && forall j:int :: 0 <= j && j < i ==> a[j] != n}

assume !(i < a.length);

{(-1 >= 0 > a[-1] == n) && (-1 < 0   ==> <= j && j < > a[j] != n)}

Document info
Document views226
Page views226
Page last viewedSat Dec 03 18:17:38 UTC 2016
Pages100
Paragraphs1586
Words3927

Comments