[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Theorem step-D8-D9

⊦ ( gs.vtail ∈ gs.orl + gs.qrl from ls.first ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D8, a) ∧ pcstepf(gs, ls, D8, a) = D9 → gstepf(gs, ls, D8, a).vtail ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).lst ∧ ( listp(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).ps, gstepf(gs, ls, D8, a).owns) ∧ ¬ dups(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl) ∧ markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).ps) ∧ markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).vs) ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).ps) ∧ gstepf(gs, ls, D8, a).orl ≠ [] ∧ gstepf(gs, ls, D8, a).phead ∈ gstepf(gs, ls, D8, a).orl ∧ rvownerok(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp, gstepf(gs, ls, D8, a).rvowns) ∧ allocrv(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp, gstepf(gs, ls, D8, a).rvowns) ∧ allocrv(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp) ∧ dom gstepf(gs, ls, D8, a).vrvHp = dom gstepf(gs, ls, D8, a).prvHp ∧ ( gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ≠ null ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D8, a).rvowns (gstepf(gs, ls, D8, a).vretRefs(gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid, gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D8, a).orl.last = gstepf(gs, ls, D8, a).vhead ∧ (gstepf(gs, ls, D8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D8, a).qrl.tail, gstepf(gs, ls, D8, a).vs)) ∨ gstepf(gs, ls, D8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D8, a).orl.butlast.last = gstepf(gs, ls, D8, a).vhead ∧ gstepf(gs, ls, D8, a).phead ≠ gstepf(gs, ls, D8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs)) ∧ ( gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last ∨ gstepf(gs, ls, D8, a).qrl ≠ [] ∧ gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl.butlast).last ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D8, a).vs[(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D8, a).success ∧ gstepf(gs, ls, D8, a).rvowns(gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid)) = Pending(lstepf(gs, ls, D8, a).tid)) ∧ ( lstepf(gs, ls, D8, a).first ∈ gstepf(gs, ls, D8, a).orl ∧ gstepf(gs, ls, D8, a).vhead ∈ gstepf(gs, ls, D8, a).orl from lstepf(gs, ls, D8, a).first) ∧ lstepf(gs, ls, D8, a).lst ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).first ∧ ( gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref ∧ gstepf(gs, ls, D8, a).pretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref ∧ lstepf(gs, ls, D8, a).rvref ∈ gstepf(gs, ls, D8, a).vrvHp ∧ lstepf(gs, ls, D8, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).vhead, gstepf(gs, ls, D8, a).vs) ∧ noid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, lstepf(gs, ls, D8, a).first, gstepf(gs, ls, D8, a).vs) ∧ noowns(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).owns)

View the proof

Infos about the proof