[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 rely-reflexive

listp(orl + qrl, vs, ps, owns) ∧ ¬ dups(orl + qrl) ∧ markedp(orl, ps) ∧ markedp(orl, vs) ∧ unmarkedp(qrl, ps) ∧ orl ≠ [] ∧ phead ∈ orl ∧ rvownerok(vretRefs, vrvHp, rvowns) ∧ allocrv(vretRefs, vrvHp) ∧ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs) ∧ rvownerok(pretRefs, prvHp, rvowns) ∧ allocrv(pretRefs, prvHp) ∧ dom vrvHp = dom prvHp ∧ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ (orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[(orl + qrl).last].next = null) ⊦ (∃ rl. orl + qrl + rl = orl + qrl) ∧ (∃ rl0. orl + rl0 = orl) ∧ vtail ∈ orl + qrl from vtail ∧ phead ∈ orl + qrl from phead ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps) ∧ equalowns(vs, ps, owns, tid, vs, ps, owns) ∧ vretRefs(tid) = vretRefs(tid) ∧ (pretRefs(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid)) ∧ rvownsrely(tid, rvowns, rvowns, vrvHp) ∧ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp) ∧ dom vrvHp ⊆ dom vrvHp ∧ prvHpRely(vrvHp, prvHp, prvHp) ∧ noidRely(tid, orl + qrl, vs, orl + qrl, vs) ∧ nextnottidRely(tid, vhead, vs, vhead, vs) ∧ ownsRely(tid, owns, owns)

View the proof

Infos about the proof