This is a listing of all goals defined over the current specification. Axioms are marked yellow, proved theorems green and unproved theorems blue. Click on individual names to get more information on the proof.
| Name: | Sequent: | Type: |
|---|---|---|
| ren-doDeqEmpty | ⊦ ren(doDeqEmpty(tid)) = DoDeqEmpty(tid) | An Axiom |
| abspc-equal | ⊦ abspc(gs, ls, pc) = abspc(gs0, ls0, pc) ↔ (pc = E4 ⊃ ls.success ↔ ls0.success ;(pc = E10 ⊃ ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ↔ ls0.success → ls0.lst = gs0.vtail ∧ gs0.ps[ls0.lst].next = null ;(pc = E11 ⊃ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ↔ ls0.lst = gs0.vtail ∧ gs0.ps[ls0.lst].next = null ;(pc = D6 ⊃ ls.success ↔ ls0.success ;(pc = D20 ⊃ ls.success → gs.ps[ls.nxt].deqID = None ↔ ls0.success → gs0.ps[ls0.nxt].deqID = None ;(pc = D21 ⊃ gs.ps[ls.nxt].deqID = None ↔ gs0.ps[ls0.nxt].deqID = None;true) ) ) ) ) ) | A User Theorem |
| ren-FLUSHHEAD | ⊦ ren(globalFLUSHHEAD) = τ | An Axiom |
| content-enq | ⊦ content(rl + r ', ps) = content(rl, ps) + ps[r].val ' | A User Theorem |
| ren-chooseE | ⊦ ren(chooseE1(r, nd, success)) = τ | An Axiom |
| ren-invDEQ | ⊦ ren(invDEQ(tid)) = InvDeq(tid) | An Axiom |
| abspc-def | ⊦ abspc(gs, ls, pc) = (pc = idle ⊃ idle ;(pc = ready ⊃ ready ;(pc = crashed ⊃ crashed ;( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ⊃ invEnq ;(pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E4 ∨ pc = E13 ∨ pc = E17 ⊃ resEnq ;( pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∧ ¬ ls.success ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∧ (ls.success → gs.ps[ls.nxt].deqID = None) ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID = None ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ⊃ invDeq ;resDeq ) ) ) ) ) ) | An Axiom |
| ren-checkEmp | ⊦ ren(checkEmp(tid)) = CheckEmp(tid) | An Axiom |
| content-base | ⊦ content([], ps) = [] | An Axiom |
| ren-chooseD | ⊦ ren(chooseD2(rvref, optval0)) = τ | An Axiom |
| DMSQastep-def | ⊦ DMSQastep(cs, aa, cs0) ↔ (∃ ca. ren(ca) = aa ∧ DMSQstep(cs, ca, cs0)) | An Axiom |
| ren-FLUSHVAL | ⊦ ren(globalFLUSHVAL(r)) = τ | An Axiom |
| ren-callRUN | ⊦ ren(callRUN(tid)) = callRun(tid) | An Axiom |
| DMSQinit-def | ⊦ DMSQinit(mkstate(gs, lsf, pcf)) ↔ (∃ r, val. r ≠ null ∧ gs.ps = ∅[r, mk(val, Some(dummytid), null)] ∧ gs.phead = r ∧ gs.vhead = r ∧ gs.vtail = r ∧ gs.orl = r ' ∧ gs.qrl = [] ∧ gs.vs = gs.ps) ∧ gs.vrvHp = ∅ ∧ gs.prvHp = ∅ ∧ gs.vretRefs = (λ tid. null) ∧ gs.pretRefs = (λ tid. null) ∧ gs.owns = (λ r. None) ∧ pcf = (λ tid. idle) ∧ (∀ tid. lsf(tid).tid = tid) | An Axiom |
| content-modtid | ⊦ content(orl, ps[r, ps[r].deqID:= opttid]) = content(orl, ps) | A User Theorem |
| DQinit-def | ⊦ DQinit(mkstate(ags, alsf, apcf)) ↔ ags.queue = [] ∧ apcf = (λ tid. idle) ∧ (∀ tid. alsf(tid).tid = tid) | An Axiom |
| abs-def | ⊦ abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)) ↔ q = content(gs.qrl, gs.ps) ∧ (∀ tid. absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(gs, lsf(tid), pcf(tid)) = apcf(tid)) | An Axiom |
| ren-retDEQ | ⊦ ren(retDEQ(tid, optval)) = RetDeq(tid, optval) | An Axiom |
| content-one | ⊦ content(r ', ps) = ps[r].val ' | A User Theorem |
| ren-doDeq | ⊦ ren(doDeq(tid)) = DoDeq(tid) | An Axiom |
| ren-tau | ⊦ ren(τ) = τ | An Axiom |
| ren-invENQ | ⊦ ren(invENQ(tid, val)) = InvEnq(tid, val) | An Axiom |
| content-rec | ⊦ content(r ' + rl, ps) = ps[r].val + content(rl, ps) | An Axiom |
| absls-def | ⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]) | An Axiom |
| content-modnotin | ⊦ ¬ r ∈ orl → content(orl, ps[r, nd]) = content(orl, ps) | A User Theorem |
| ren-doEnq | ⊦ ren(doEnq(tid)) = DoEnq(tid) | An Axiom |
| ren-retENQ | ⊦ ren(retENQ(tid)) = RetEnq(tid) | An Axiom |
| ren-CRASH | ⊦ ren(globalCRASH) = globalCrash | An Axiom |