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: |
|---|---|---|
| disj-ARetDeq-tau | ⊦ ARetDeq(tid, optval) ≠ τ | An Axiom |
| updsel--dotpcf-dotpcf | ⊦ (s.pcf:= pcf).pcf = pcf | An Axiom |
| disj-AInvDeq-ARetEnq | ⊦ AInvDeq(tid) ≠ ARetEnq(tid0) | An Axiom |
| updsel--dotival-dotival | ⊦ (ls.ival:= ival).ival = ival | An Axiom |
| disj-ADoEnq-tau | ⊦ ADoEnq(tid) ≠ τ | An Axiom |
| updsel--dotival-dotvalue | ⊦ (ls.ival:= ival).value = ls.value | An Axiom |
| sel-AInvEnq-dotval | ⊦ AInvEnq(tid, val).val = val | An Axiom |
| disj-AInvEnq-globalACrash | ⊦ AInvEnq(tid, val) ≠ globalACrash | An Axiom |
| disj-invDeq-resDeq | ⊦ invDeq ≠ resDeq | An Axiom |
| updsel--dotlsf-dotpcf | ⊦ (s.lsf:= lsf).pcf = s.pcf | An Axiom |
| updsel--dotoptval-dottid | ⊦ (ls.optval:= oval0).tid = ls.tid | An Axiom |
| lstepf-ready-AINVENQ | ⊦ lstepf(gs, ls, ready, AInvEnq(ls.tid, value)) = ls.ival:= value | An Axiom |
| updsel--dotival-dotoval | ⊦ (ls.ival:= ival).oval = ls.oval | An Axiom |
| disj-ready-resDeq | ⊦ ready ≠ resDeq | An Axiom |
| inj-ADoDeq | ⊦ ADoDeq(tid) = ADoDeq(tid0) ↔ tid = tid0 | An Axiom |
| upd-mkstate-dotlsf | ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf) | An Axiom |
| inj-ARetEnq | ⊦ ARetEnq(tid) = ARetEnq(tid0) ↔ tid = tid0 | An Axiom |
| updsel--dotoptval-dotoval | ⊦ (ls.optval:= oval0).oval = ls.oval | An Axiom |
| disj-AInvEnq-tau | ⊦ AInvEnq(tid, val) ≠ τ | An Axiom |
| sel-ADoEnq-dottid | ⊦ ADoEnq(tid).tid = tid | An Axiom |
| updsel--dotoval-dotvalue | ⊦ (ls.oval:= oval).value = ls.value | An Axiom |
| updsel--dotoptval-dotival | ⊦ (ls.optval:= oval0).ival = ls.ival | An Axiom |
| disj-ARetEnq-callARun | ⊦ ARetEnq(tid) ≠ callARun(tid0) | An Axiom |
| sel-mkls-dotival | ⊦ mkls(tid, ival, oval, ival0, oval0).ival = ival | An Axiom |
| gstepf-ready | ⊦ gstepf(gs, ls, ready, a) = gs | An Axiom |
| disj-resDeq-resEnq | ⊦ resDeq ≠ resEnq | An Axiom |
| pre-invEnq | ⊦ pre(gs, ls, invEnq, a) ↔ a = ADoEnq(ls.tid) | An Axiom |
| updsel--dotoptval-dotoptval | ⊦ (ls.optval:= oval0).optval = oval0 | An Axiom |
| disj-ADoDeq-ARetDeq | ⊦ ADoDeq(tid) ≠ ARetDeq(tid0, optval) | An Axiom |
| pcstepf-resDeq-ARETDEQ | ⊦ pcstepf(gs, ls, resDeq, ARetDeq(ls.tid, ls.oval)) = ready | An Axiom |
| disj-invEnq-ready | ⊦ invEnq ≠ ready | An Axiom |
| disj-ARetDeq-ARetEnq | ⊦ ARetDeq(tid, optval) ≠ ARetEnq(tid0) | An Axiom |
| disj-crashed-resDeq | ⊦ crashed ≠ resDeq | An Axiom |
| disj-callARun-globalACrash | ⊦ callARun(tid) ≠ globalACrash | An Axiom |
| updsel--dotvalue-dotoval | ⊦ (ls.value:= ival0).oval = ls.oval | An Axiom |
| disj-callARun-tau | ⊦ callARun(tid) ≠ τ | An Axiom |
| sel-mkstate-dotgstate | ⊦ mkstate(gstate, lsf, pcf).gstate = gstate | An Axiom |
| updsel--dottid-dotoval | ⊦ (ls.tid:= tid).oval = ls.oval | An Axiom |
| upd-mkls-dottid | ⊦ mkls(tid, ival, oval, ival0, oval0).tid:= tid0 = mkls(tid0, ival, oval, ival0, oval0) | An Axiom |
| pcstepf-invEnq-ADOENQ | ⊦ pcstepf(gs, ls, invEnq, ADoEnq(ls.tid)) = resEnq | An Axiom |
| updsel--dottid-dotvalue | ⊦ (ls.tid:= tid).value = ls.value | An Axiom |
| disj-crashed-ready | ⊦ crashed ≠ ready | An Axiom |
| disj-ADoDeq-ADoEnq | ⊦ ADoDeq(tid) ≠ ADoEnq(tid0) | An Axiom |
| DurQstep | ⊦ DurQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) ↔ (∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf) | An Axiom |
| gen-DurQLState | DurQLState freely generated by mkls; | An Axiom |
| disj-ADoDeq-callARun | ⊦ ADoDeq(tid) ≠ callARun(tid0) | An Axiom |
| updsel--dotqueue-dotqueue | ⊦ (gs.queue:= queue).queue = queue | An Axiom |
| lstepf-resDeq-ARETDEQ | ⊦ lstepf(gs, ls, resDeq, ARetDeq(ls.tid, ls.oval)) = ls.optval:= ls.oval | An Axiom |
| lstepf-resEnq-ARETENQ | ⊦ lstepf(gs, ls, resEnq, ARetEnq(ls.tid)) = ls | An Axiom |
| gen-DurQGState | DurQGState freely generated by mkgs; | An Axiom |
| elim-mkstate | ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf) | An Axiom |
| disj-idle-resDeq | ⊦ idle ≠ resDeq | An Axiom |
| pre-idle | ⊦ pre(gs, ls, idle, a) ↔ a = callARun(ls.tid) | An Axiom |
| sel-callARun-dottid | ⊦ callARun(tid).tid = tid | An Axiom |
| case-DurQPC | ⊦ pc = crashed ∨ pc = idle ∨ pc = invDeq ∨ pc = invEnq ∨ pc = ready ∨ pc = resDeq ∨ pc = resEnq | An Axiom |
| DurQLInv | ⊦ DurQLInv(gs, ls, pc) ↔ true | An Axiom |
| updsel--dotvalue-dotvalue | ⊦ (ls.value:= ival0).value = ival0 | An Axiom |
| case-DurQLState | ⊦ mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval) = ls | An Axiom |
| disj-invDeq-resEnq | ⊦ invDeq ≠ resEnq | An Axiom |
| updsel--dotoval-dottid | ⊦ (ls.oval:= oval).tid = ls.tid | An Axiom |
| updsel--dotvalue-dotival | ⊦ (ls.value:= ival0).ival = ls.ival | An Axiom |
| pcstepf-invDeq-ADODEQ | ⊦ pcstepf(gs, ls, invDeq, ADoDeq(ls.tid)) = resDeq | An Axiom |
| updsel--dottid-dotoptval | ⊦ (ls.tid:= tid).optval = ls.optval | An Axiom |
| disj-ARetEnq-tau | ⊦ ARetEnq(tid) ≠ τ | An Axiom |
| disj-ADoDeq-AInvEnq | ⊦ ADoDeq(tid) ≠ AInvEnq(tid0, val) | An Axiom |
| disj-AInvDeq-globalACrash | ⊦ AInvDeq(tid) ≠ globalACrash | An Axiom |
| disj-idle-invDeq | ⊦ idle ≠ invDeq | An Axiom |
| sel-mkstate-dotlsf | ⊦ mkstate(gstate, lsf, pcf).lsf = lsf | An Axiom |
| lstep | ⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a) | An Axiom |
| case-DurQGState | ⊦ mkgs(gs.queue) = gs | An Axiom |
| case-DurQState | ⊦ mkstate(s.gstate, s.lsf, s.pcf) = s | An Axiom |
| gstepf-idle-ARun | ⊦ gstepf(gs, ls, idle, callARun(ls.tid)) = gs | An Axiom |
| updsel--dotgstate-dotlsf | ⊦ (s.gstate:= gstate).lsf = s.lsf | An Axiom |
| sel-mkls-dotvalue | ⊦ mkls(tid, ival, oval, ival0, oval0).value = ival0 | An Axiom |
| disj-AInvEnq-ARetDeq | ⊦ AInvEnq(tid, val) ≠ ARetDeq(tid0, optval) | An Axiom |
| pcstepf-idle-ARun | ⊦ pcstepf(gs, ls, idle, callARun(ls.tid)) = ready | An Axiom |
| upd-mkls-dotival | ⊦ mkls(tid, ival, oval, ival0, oval0).ival:= ival1 = mkls(tid, ival1, oval, ival0, oval0) | An Axiom |
| disj-crashed-invDeq | ⊦ crashed ≠ invDeq | An Axiom |
| disj-idle-ready | ⊦ idle ≠ ready | An Axiom |
| disj-globalACrash-tau | ⊦ globalACrash ≠ τ | An Axiom |
| gen-DurQPC | DurQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq; | An Axiom |
| inj-AInvDeq | ⊦ AInvDeq(tid) = AInvDeq(tid0) ↔ tid = tid0 | An Axiom |
| disj-ADoEnq-ARetEnq | ⊦ ADoEnq(tid) ≠ ARetEnq(tid0) | An Axiom |
| pcstepf-resEnq-ARETENQ | ⊦ pcstepf(gs, ls, resEnq, ARetEnq(ls.tid)) = ready | An Axiom |
| updsel--dottid-dotival | ⊦ (ls.tid:= tid).ival = ls.ival | An Axiom |
| updsel--dotlsf-dotlsf | ⊦ (s.lsf:= lsf).lsf = lsf | An Axiom |
| sel-mkgs-dotqueue | ⊦ mkgs(queue).queue = queue | An Axiom |
| upd-mkls-dotoval | ⊦ mkls(tid, ival, oval, ival0, oval0).oval:= oval1 = mkls(tid, ival, oval1, ival0, oval0) | An Axiom |
| updsel--dotoptval-dotvalue | ⊦ (ls.optval:= oval0).value = ls.value | An Axiom |
| updsel--dotival-dottid | ⊦ (ls.ival:= ival).tid = ls.tid | An Axiom |
| pre-resDeq | ⊦ pre(gs, ls, resDeq, a) ↔ a = ARetDeq(ls.tid, ls.oval) | An Axiom |
| updsel--dotgstate-dotgstate | ⊦ (s.gstate:= gstate).gstate = gstate | An Axiom |
| disj-ready-resEnq | ⊦ ready ≠ resEnq | An Axiom |
| lstepf-invDeq-ADODEQ | ⊦ lstepf(gs, ls, invDeq, ADoDeq(ls.tid)) = (gs.queue = [] ⊃ ls.oval:= Empty;ls.oval:= Val(gs.queue.head)) | An Axiom |
| pcstepf-ready-AINVDEQ | ⊦ pcstepf(gs, ls, ready, AInvDeq(ls.tid)) = invDeq | An Axiom |
| sel-ADoDeq-dottid | ⊦ ADoDeq(tid).tid = tid | An Axiom |
| disj-ADoEnq-callARun | ⊦ ADoEnq(tid) ≠ callARun(tid0) | An Axiom |
| lstepf-invEnq-ADOENQ | ⊦ lstepf(gs, ls, invEnq, ADoEnq(ls.tid)) = ls | An Axiom |
| disj-idle-resEnq | ⊦ idle ≠ resEnq | An Axiom |
| gstepf-resDeq-ARETDEQ | ⊦ gstepf(gs, ls, resDeq, ARetDeq(ls.tid, ls.oval)) = gs | An Axiom |
| sel-ARetEnq-dottid | ⊦ ARetEnq(tid).tid = tid | An Axiom |
| disj-invDeq-invEnq | ⊦ invDeq ≠ invEnq | An Axiom |
| pre-crashed | ⊦ pre(gs, ls, crashed, a) ↔ false | An Axiom |
| upd-mkls-dotoptval | ⊦ mkls(tid, ival, oval, ival0, oval0).optval:= oval2 = mkls(tid, ival, oval, ival0, oval2) | An Axiom |
| gen-DurQAction | DurQAction freely generated by globalACrash, τ, ADoDeq, ADoEnq, AInvDeq, AInvEnq, ARetDeq, ARetEnq, callARun; | An Axiom |
| inj-ADoEnq | ⊦ ADoEnq(tid) = ADoEnq(tid0) ↔ tid = tid0 | An Axiom |
| sel-AInvEnq-dottid | ⊦ AInvEnq(tid, val).tid = tid | An Axiom |
| pre-ready | ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = AInvEnq(ls.tid, value)) ∨ a = AInvDeq(ls.tid) | An Axiom |
| updsel--dotoval-dotoval | ⊦ (ls.oval:= oval).oval = oval | An Axiom |
| inj-mkstate | ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0 | An Axiom |
| updsel--dotoval-dotival | ⊦ (ls.oval:= oval).ival = ls.ival | An Axiom |
| disj-AInvDeq-AInvEnq | ⊦ AInvDeq(tid) ≠ AInvEnq(tid0, val) | An Axiom |
| sel-mkls-dotoptval | ⊦ mkls(tid, ival, oval, ival0, oval0).optval = oval0 | An Axiom |
| disj-AInvDeq-ARetDeq | ⊦ AInvDeq(tid) ≠ ARetDeq(tid0, optval) | An Axiom |
| disj-ARetEnq-globalACrash | ⊦ ARetEnq(tid) ≠ globalACrash | An Axiom |
| disj-crashed-resEnq | ⊦ crashed ≠ resEnq | An Axiom |
| gstepf-resEnq-ARETENQ | ⊦ gstepf(gs, ls, resEnq, ARetEnq(ls.tid)) = gs | An Axiom |
| inj-callARun | ⊦ callARun(tid) = callARun(tid0) ↔ tid = tid0 | An Axiom |
| updsel--dotpcf-dotgstate | ⊦ (s.pcf:= pcf).gstate = s.gstate | An Axiom |
| lstepf-ready-AINVDEQ | ⊦ lstepf(gs, ls, ready, AInvDeq(ls.tid)) = ls | An Axiom |
| case-DurQAction | ⊦ a = ADoDeq(a.tid) ∨ a = ADoEnq(a.tid) ∨ a = AInvDeq(a.tid) ∨ a = AInvEnq(a.tid, a.val) ∨ a = ARetDeq(a.tid, a.optval) ∨ a = ARetEnq(a.tid) ∨ a = callARun(a.tid) ∨ a = globalACrash ∨ a = τ | An Axiom |
| disj-ADoDeq-ARetEnq | ⊦ ADoDeq(tid) ≠ ARetEnq(tid0) | An Axiom |
| updsel--dotpcf-dotlsf | ⊦ (s.pcf:= pcf).lsf = s.lsf | An Axiom |
| disj-crashed-idle | ⊦ crashed ≠ idle | An Axiom |
| inj-AInvEnq | ⊦ AInvEnq(tid, val) = AInvEnq(tid0, val0) ↔ tid = tid0 ∧ val = val0 | An Axiom |
| disj-invEnq-resDeq | ⊦ invEnq ≠ resDeq | An Axiom |
| disj-AInvDeq-callARun | ⊦ AInvDeq(tid) ≠ callARun(tid0) | An Axiom |
| inj-ARetDeq | ⊦ ARetDeq(tid, optval) = ARetDeq(tid0, optval0) ↔ tid = tid0 ∧ optval = optval0 | An Axiom |
| disj-crashed-invEnq | ⊦ crashed ≠ invEnq | An Axiom |
| disj-ADoEnq-globalACrash | ⊦ ADoEnq(tid) ≠ globalACrash | An Axiom |
| pre-invDeq | ⊦ pre(gs, ls, invDeq, a) ↔ a = ADoDeq(ls.tid) | An Axiom |
| upd-mkstate-dotpcf | ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0) | An Axiom |
| disj-ADoDeq-tau | ⊦ ADoDeq(tid) ≠ τ | An Axiom |
| disj-invDeq-ready | ⊦ invDeq ≠ ready | An Axiom |
| elim-mkgs | ⊦ queue = gs.queue ↔ gs = mkgs(queue) | An Axiom |
| disj-ADoEnq-AInvDeq | ⊦ ADoEnq(tid) ≠ AInvDeq(tid0) | An Axiom |
| DurQInv | ⊦ DurQInv(gs, lsf, pcf) ↔ DurQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DurQLInv(gs, lsf(tid), pcf(tid))) | An Axiom |
| pcstepf-ready-AINVENQ | ⊦ pcstepf(gs, ls, ready, AInvEnq(ls.tid, value)) = invEnq | An Axiom |
| disj-AInvDeq-tau | ⊦ AInvDeq(tid) ≠ τ | An Axiom |
| disj-idle-invEnq | ⊦ idle ≠ invEnq | An Axiom |
| updsel--dotvalue-dotoptval | ⊦ (ls.value:= ival0).optval = ls.optval | An Axiom |
| sel-mkstate-dotpcf | ⊦ mkstate(gstate, lsf, pcf).pcf = pcf | An Axiom |
| DurQGInv | ⊦ DurQGInv(gs) ↔ true | An Axiom |
| updsel--dotlsf-dotgstate | ⊦ (s.lsf:= lsf).gstate = s.gstate | An Axiom |
| gstepf-invEnq-ADOENQ | ⊦ gstepf(gs, ls, invEnq, ADoEnq(ls.tid)) = gs.queue:= (gs.queue + ls.ival) | An Axiom |
| sel-ARetDeq-dotoptval | ⊦ ARetDeq(tid, optval).optval = optval | An Axiom |
| upd-mkstate-dotgstate | ⊦ (mkstate(gstate, lsf, pcf).gstate:= gstate0) = mkstate(gstate0, lsf, pcf) | An Axiom |
| upd-mkls-dotvalue | ⊦ mkls(tid, ival, oval, ival0, oval0).value:= ival2 = mkls(tid, ival, oval, ival2, oval0) | An Axiom |
| updsel--dotvalue-dottid | ⊦ (ls.value:= ival0).tid = ls.tid | An Axiom |
| updsel--dotoval-dotoptval | ⊦ (ls.oval:= oval).optval = ls.optval | An Axiom |
| inj-mkgs | ⊦ mkgs(queue) = mkgs(queue0) ↔ queue = queue0 | An Axiom |
| disj-AInvEnq-ARetEnq | ⊦ AInvEnq(tid, val) ≠ ARetEnq(tid0) | An Axiom |
| disj-ARetDeq-callARun | ⊦ ARetDeq(tid, optval) ≠ callARun(tid0) | An Axiom |
| disj-ARetDeq-globalACrash | ⊦ ARetDeq(tid, optval) ≠ globalACrash | An Axiom |
| gstepf-invDeq-ADODEQ | ⊦ gstepf(gs, ls, invDeq, a) = (gs.queue = [] ⊃ gs;gs.queue:= gs.queue.tail) | An Axiom |
| upd-mkgs-dotqueue | ⊦ mkgs(queue).queue:= queue0 = mkgs(queue0) | An Axiom |
| gen-DurQState | DurQState freely generated by mkstate; | An Axiom |
| disj-AInvEnq-callARun | ⊦ AInvEnq(tid, val) ≠ callARun(tid0) | An Axiom |
| sel-mkls-dotoval | ⊦ mkls(tid, ival, oval, ival0, oval0).oval = oval | An Axiom |
| sel-ARetDeq-dottid | ⊦ ARetDeq(tid, optval).tid = tid | An Axiom |
| pre-resEnq | ⊦ pre(gs, ls, resEnq, a) ↔ a = ARetEnq(ls.tid) | An Axiom |
| sel-AInvDeq-dottid | ⊦ AInvDeq(tid).tid = tid | An Axiom |
| disj-ADoDeq-AInvDeq | ⊦ ADoDeq(tid) ≠ AInvDeq(tid0) | An Axiom |
| disj-invEnq-resEnq | ⊦ invEnq ≠ resEnq | An Axiom |
| inj-mkls | ⊦ mkls(tid, ival, oval, ival0, oval0) = mkls(tid0, ival1, oval1, ival2, oval2) ↔ tid = tid0 ∧ ival = ival1 ∧ oval = oval1 ∧ ival0 = ival2 ∧ oval0 = oval2 | An Axiom |
| sel-mkls-dottid | ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid | An Axiom |
| elim-mkls | ⊦ (((tid = ls.tid ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, ival, oval, value, optval) | An Axiom |
| disj-ADoEnq-AInvEnq | ⊦ ADoEnq(tid) ≠ AInvEnq(tid0, val) | An Axiom |
| updsel--dotival-dotoptval | ⊦ (ls.ival:= ival).optval = ls.optval | An Axiom |
| Crash | ACrash(; pcf){pcf := λ tid. (pcf(tid) = idle ⊃ idle;crashed)} | An Axiom |
| disj-ADoDeq-globalACrash | ⊦ ADoDeq(tid) ≠ globalACrash | An Axiom |
| lstepf-idle-ARun | ⊦ lstepf(gs, ls, idle, callARun(ls.tid)) = ls | An Axiom |
| updsel--dottid-dottid | ⊦ (ls.tid:= tid).tid = tid | An Axiom |
| updsel--dotgstate-dotpcf | ⊦ (s.gstate:= gstate).pcf = s.pcf | An Axiom |
| disj-ADoEnq-ARetDeq | ⊦ ADoEnq(tid) ≠ ARetDeq(tid0, optval) | An Axiom |
| DurQstep-def0 | ⊦ DurQstep(mkstate(gs, lsf, pcf), a, durqs0) ↔ (a = globalACrash ⊃ durqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ durqs0 = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ) | A User Theorem |
| gstepf-DoDeq | ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = (gs.queue = [] ⊃ gs;gs.queue:= gs.queue.tail) | A User Theorem |
| gstepf-DoEnq | ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), invEnq, ADoEnq(tid)) = gs.queue:= (gs.queue + ival) | A User Theorem |
| gstepf-RetDeq | ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), resDeq, ARetDeq(tid, oval)) = gs | A User Theorem |
| gstepf-RetEnq | ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), resEnq, ARetEnq(tid)) = gs | A User Theorem |
| gstepf-callRun | ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), idle, callARun(tid)) = gs | A User Theorem |
| lstepf-DoDeq | ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = mkls(tid, ival, (gs.queue = [] ⊃ Empty;Val(gs.queue.head)), value, optval) | A User Theorem |
| lstepf-DoEnq | ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), invEnq, ADoEnq(tid)) = mkls(tid, ival, oval, value, optval) | A User Theorem |
| lstepf-InvDeq | ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), ready, AInvDeq(tid)) = mkls(tid, ival, oval, value, optval) | A User Theorem |
| lstepf-InvEnq | ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), ready, AInvEnq(tid, value0)) = mkls(tid, value0, oval, value, optval) | A User Theorem |
| lstepf-RetDeq | ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), resDeq, ARetDeq(tid, oval)) = mkls(tid, ival, oval, value, oval) | A User Theorem |
| lstepf-RetEnq | ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), resEnq, ARetEnq(tid)) = mkls(tid, ival, oval, value, optval) | A User Theorem |
| lstepf-callRun | ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), idle, callARun(tid)) = mkls(tid, ival, oval, value, optval) | A User Theorem |
| pcstepf-DoDeq | ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = resDeq | A User Theorem |
| pcstepf-DoEnq | ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), invEnq, ADoEnq(tid)) = resEnq | A User Theorem |
| pcstepf-InvDeq | ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), ready, AInvDeq(tid)) = invDeq | A User Theorem |
| pcstepf-InvEnq | ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), ready, AInvEnq(tid, value0)) = invEnq | A User Theorem |
| pcstepf-RetDeq | ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), resDeq, ARetDeq(tid, oval)) = ready | A User Theorem |
| pcstepf-RetEnq | ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), resEnq, ARetEnq(tid)) = ready | A User Theorem |
| pcstepf-callRun | ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), idle, callARun(tid)) = ready | A User Theorem |