| THM | lemma13i_m1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( r,q:P. inv13i{}(n; (action_m1{} s); r; q)) |
| THM | lemma13i_m2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( r,q:P. inv13i{}(n; (action_m2{} s); r; q)) |
| THM | lemma13i_m3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( r,q:P. inv13i{}(n; (action_m3{} s); r; q)) |
| THM | lemma13i_m4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( r,q:P. inv13i{}(n; (action_m4{} s); r; q)) |
| THM | lemma13i_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p1{}(p) s); r; q)) |
| THM | lemma13i_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p2{}(p) s); r; q)) |
| THM | lemma13i_p3_p4_neq | n: . s:state. p:P. rval,cvval,argval: . r,q:P. s':state.
in_exec{}(sci_program{}(n); s)
 next_mesg(p;s.h) = read_cache_freshR(m::rval::cvval::argval::[])
next_mesg(p;s.h) = read_cache_goneR(m::rval::cvval::argval::[])
 hasrank(s;r)
 hasrank(s;q)
 rank(s;q) = rank(s;r) + 1
 entering(s;r) maxrank_visiting(n;s;r)
 ( c1,c2:com
e:zexp
c1
= ( s.statusp:=Inqueue
([h<-(hsend(p;rval;prependQ(p::[]))::h)]
(predp:=q
([h<-(hreceive(p;h)::h)]
("arg"nil:=argval (cvnil:=cvval (r:=rval (q:=m s))))))))
(c2 = skip c2 = (cv-p:=cv- ;cs-p:=e))
s' = (c1 ;c2) s)
 {hasrank(s';r)
hasrank(s';q)
rank(s';q) = rank(s';r) + 1
(entering(s';r) maxrank_visiting(n;s';r))} |
| THM | lemma13i_p3_p4_eq | n: . s:state. rval,cvval,argval: . r,p:P. s':state.
in_exec{}(sci_program{}(n); s)
 next_mesg(p;s.h) = read_cache_freshR(m::rval::cvval::argval::[])
next_mesg(p;s.h) = read_cache_goneR(m::rval::cvval::argval::[])
 hasrank(s;r)
 hasrank(s;p)
 rank(s;p) = rank(s;r) + 1
 entering(s;r) maxrank_visiting(n;s;r)
 ( c1,c2:com
e:zexp
c1
= ( s.statusp:=Inqueue
([h<-(hsend(p;rval;prependQ(p::[]))::h)]
(predp:=q
([h<-(hreceive(p;h)::h)]
("arg"nil:=argval (cvnil:=cvval (r:=rval (q:=m s))))))))
(c2 = skip c2 = (cv-p:=cv- ;cs-p:=e))
s' = (c1 ;c2) s)
 {hasrank(s';r)
hasrank(s';p)
rank(s';p) = rank(s';r) + 1
(entering(s';r) maxrank_visiting(n;s';r))} |
| THM | lemma13i_p3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p3{}(p) s); r; q)) |
| THM | lemma13i_p4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p4{}(p) s); r; q)) |
| THM | lemma13i_p5a | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q,qval:P.
next_mesg(p;s.h) = prependQ(qval::[])
 status-p_ = Inlist
 cs-p_ = dirty{}
 inv13i{}(n;
(cs-p:=fresh{}
(pred-p:=q-
([h<-(hsend(p;qval;prependR(p
::p::ok{}::cv-p_::cs-p_::[]))
::h)]
([h<-(hreceive(p;h)::h)] (q-:=qval s)))));
r;
q)) |
| THM | lemma13i_p5b | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q,qval:P.
next_mesg(p;s.h) = prependQ(qval::[])
 status-p_ = Inlist
 (cs-p_ = dirty{})
 inv13i{}(n;
(pred-p:=q-
([h<-(hsend(p;qval;prependR(p
::p::ok{}::cv-p_::cs-p_::[]))
::h)]
([h<-(hreceive(p;h)::h)] (q-:=qval s))));
r;
q)) |
| THM | lemma13i_p5c | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q,qval:P.
next_mesg(p;s.h) = prependQ(qval::[])
 status-p_ = Delleft
 succ-p_ = nil
 inv13i{}(n;
(pred-p:=nil
(cs-p:=invalid{}
([h<-(hsend(p;qval;prependR(p
::nil::ok{}::cv-p_::cs-p_::[]))
::h)]
([h<-(hreceive(p;h)::h)] (q-:=qval s)))));
r;
q)) |
| THM | lemma13i_p5d | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q,qval:P.
next_mesg(p;s.h) = prependQ(qval::[])
 status-p_ = Delleft
 (succ-p_ = nil)
 inv13i{}(n;
(succ-p:=nil
(pred-p:=nil
(cs-p:=invalid{}
([h<-(hsend(p;qval;prependR(p
::succ-p_::retry{}::cv-p_::cs-p_::[]))
::h)]
([h<-(hreceive(p;h)::h)] (q-:=qval s))))));
r;
q)) |
| THM | lemma13i_p5e | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q,qval:P.
next_mesg(p;s.h) = prependQ(qval::[])
 (status-p_ = Inlist)
 (status-p_ = Delleft)
 inv13i{}(n;
([h<-(hsend(p;qval;prependR(p
::p::retry{}::cv-p_::cs-p_::[]))
::h)]
([h<-(hreceive(p;h)::h)] (q-:=qval s)));
r;
q)) |
| THM | lemma13i_p5 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p5{}(p) s); r; q)) |
| THM | lemma13i_p6_neq | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p,q,r:P. cv,cs: . inv13k{}(n; s; p; q; r; cv; cs))
 ( p:P. q,cv,cs: . inv13l{}(n; s; p; q; cv; cs))
 ( p,q,r,qval:P. rval,cvval,csval: .
list_el(mesg;prependQ(q::[]);buf[r]_)
 list_el(mesg;prependR(qval
::rval::ok{}::cvval::csval::[]);buf[p]_)
 hasrank(s;q)
 rank(s;q) = rank(s;r) + 1
 maxrank_visiting(n;s;r)
 (r = p)
 qval = rval rval = nil
 False) |
| THM | lemma13i_p6_eq | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p,q,r:P. cv,cs: . inv13k{}(n; s; p; q; r; cv; cs))
 ( p:P. q,cv,cs: . inv13l{}(n; s; p; q; cv; cs))
 ( p,q,qval:P. rval,cvval,csval: .
list_el(mesg;prependR(qval
::rval::ok{}::cvval::csval::[]);buf[p]_)
 visiting(s;q)
 hasrank(s;q)
 qval = rval rval = nil
 rank(s;q) rank(s;p)) |
| THM | lemma13i_p6c | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q,qval:P. rval,argval,cvval,csval: .
next_mesg(p;s.h)
= prependR(qval::rval::argval::cvval::csval::[])
 (argval = ok{})
 inv13i{}(n;
([h<-(hsend(p;rval;prependQ(p::[]))::h)]
([h<-(hreceive(p;h)::h)]
(cs-:=csval
(cv-:=cvval
(arg-:=argval (r-:=rval (q-:=qval s)))))));
r;
q)) |
| THM | lemma13i_p6 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p6{}(p) s); r; q)) |
| THM | lemma13i_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p7{}(p) s); r; q)) |
| THM | lemma13i_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p8{}(p) s); r; q)) |
| THM | lemma13i_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p9{}(p) s); r; q)) |
| THM | lemma13i_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p10{}(p) s); r; q)) |
| THM | lemma13i_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p11{}(p) s); r; q)) |
| THM | lemma13i_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p12{}(p) s); r; q)) |
| THM | lemma13i_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p13{}(p) s); r; q)) |
| THM | lemma13i_p14 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p14{}(p) s); r; q)) |
| THM | lemma13i_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p15{}(p) s); r; q)) |
| THM | lemma13i_p16 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p16{}(p) s); r; q)) |
| THM | lemma13i_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,r,q:P. inv13i{}(n; (action_p17{}(p) s); r; q)) |
| THM | lemma13i_ht | n:
htriple(s.inv13all_assump(n;s);sci_program{}(n);s. r,q:P.
inv13i{}(n;
s;
r;
q)) |