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

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 base for Specification DQ

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:
pcstepf-resDeq-RETDEQ ⊦ pcstepf(gs, ls, resDeq, RetDeq(ls.tid, ls.oval)) = ready An Axiom
updsel--dotpcf-dotpcf ⊦ (s.pcf:= pcf).pcf = pcf An Axiom
updsel--dotival-dotival ⊦ (ls.ival:= ival).ival = ival An Axiom
updsel--dotival-dotvalue ⊦ (ls.ival:= ival).value = ls.value An Axiom
disj-invDeq-resDeq ⊦ invDeq ≠ resDeq An Axiom
updsel--dotlsf-dotpcf ⊦ (s.lsf:= lsf).pcf = s.pcf An Axiom
disj-InvEnq-tau ⊦ InvEnq(tid, val) ≠ τ An Axiom
updsel--dotoptval-dottid ⊦ (ls.optval:= oval0).tid = ls.tid An Axiom
disj-InvDeq-globalCrash ⊦ InvDeq(tid) ≠ globalCrash An Axiom
sel-DoDeqEmpty-dottid ⊦ DoDeqEmpty(tid).tid = tid An Axiom
updsel--dotival-dotoval ⊦ (ls.ival:= ival).oval = ls.oval An Axiom
gstepf-DoDeq ⊦ gstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeq(tid)) = gs.queue:= gs.queue.tail A User Theorem
disj-ready-resDeq ⊦ ready ≠ resDeq An Axiom
case-DQLState ⊦ mkls(ls.tid, ls.obsEmpty, ls.ival, ls.oval, ls.value, ls.optval) = ls An Axiom
disj-globalCrash-tau ⊦ globalCrash ≠ τ An Axiom
upd-mkstate-dotlsf ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf) An Axiom
sel-CheckEmp-dottid ⊦ CheckEmp(tid).tid = tid An Axiom
case-DQGState ⊦ mkgs(gs.queue) = gs An Axiom
updsel--dotobsEmpty-dotival ⊦ (ls.obsEmpty:= obsEmpty).ival = ls.ival An Axiom
lstepf-RetEnq ⊦ lstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), resEnq, RetEnq(tid)) = mkls(tid, obsEmpty, ival, oval, value, optval) A User Theorem
disj-RetEnq-callRun ⊦ RetEnq(tid) ≠ callRun(tid0) An Axiom
updsel--dotoptval-dotoval ⊦ (ls.optval:= oval0).oval = ls.oval An Axiom
disj-CheckEmp-RetEnq ⊦ CheckEmp(tid) ≠ RetEnq(tid0) An Axiom
disj-CheckEmp-callRun ⊦ CheckEmp(tid) ≠ callRun(tid0) An Axiom
gen-DQLStateDQLState freely generated by mkls; An Axiom
updsel--dotvalue-dotobsEmpty ⊦ (ls.value:= ival0).obsEmpty ↔ ls.obsEmpty An Axiom
updsel--dotoval-dotvalue ⊦ (ls.oval:= oval).value = ls.value An Axiom
updsel--dotoptval-dotival ⊦ (ls.optval:= oval0).ival = ls.ival An Axiom
updsel--dotobsEmpty-dotoval ⊦ (ls.obsEmpty:= obsEmpty).oval = ls.oval An Axiom
gstepf-DoDeqEmpty ⊦ gstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeqEmpty(tid)) = gs A User Theorem
sel-mkls-dotival ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival An Axiom
gstepf-ready ⊦ gstepf(gs, ls, ready, a) = gs An Axiom
pcstepf-InvEnq ⊦ pcstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvEnq(tid, value0)) = invEnq A User Theorem
lstepf-resDeq-RETDEQ ⊦ lstepf(gs, ls, resDeq, RetDeq(ls.tid, ls.oval)) = ls.optval:= ls.oval An Axiom
pre-invEnq ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid) An Axiom
disj-resDeq-resEnq ⊦ resDeq ≠ resEnq An Axiom
inj-InvDeq ⊦ InvDeq(tid) = InvDeq(tid0) ↔ tid = tid0 An Axiom
updsel--dotoptval-dotoptval ⊦ (ls.optval:= oval0).optval = oval0 An Axiom
disj-InvDeq-callRun ⊦ InvDeq(tid) ≠ callRun(tid0) An Axiom
disj-invEnq-ready ⊦ invEnq ≠ ready An Axiom
lstepf-idle-Run ⊦ lstepf(gs, ls, idle, callRun(ls.tid)) = ls An Axiom
sel-RetDeq-dottid ⊦ RetDeq(tid, optval).tid = tid An Axiom
disj-crashed-resDeq ⊦ crashed ≠ resDeq An Axiom
disj-callRun-tau ⊦ callRun(tid) ≠ τ An Axiom
updsel--dotvalue-dotoval ⊦ (ls.value:= ival0).oval = ls.oval An Axiom
sel-InvDeq-dottid ⊦ InvDeq(tid).tid = tid An Axiom
gen-DQStateDQState freely generated by mkstate; An Axiom
sel-mkstate-dotgstate ⊦ mkstate(gstate, lsf, pcf).gstate = gstate An Axiom
disj-InvDeq-RetEnq ⊦ InvDeq(tid) ≠ RetEnq(tid0) An Axiom
updsel--dottid-dotoval ⊦ (ls.tid:= tid).oval = ls.oval An Axiom
lstepf-DoDeqEmpty ⊦ lstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeqEmpty(tid)) = mkls(tid, obsEmpty, ival, Empty, value, optval) A User Theorem
gstepf-invDeq-DODEQEMPTY ⊦ gstepf(gs, ls, invDeq, DoDeqEmpty(ls.tid)) = gs An Axiom
disj-CheckEmp-DoDeq ⊦ CheckEmp(tid) ≠ DoDeq(tid0) An Axiom
inj-DoDeqEmpty ⊦ DoDeqEmpty(tid) = DoDeqEmpty(tid0) ↔ tid = tid0 An Axiom
upd-mkls-dottid ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid:= tid0 = mkls(tid0, obsEmpty, ival, oval, ival0, oval0) An Axiom
updsel--dottid-dotvalue ⊦ (ls.tid:= tid).value = ls.value An Axiom
lstepf-DoDeq ⊦ lstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeq(tid)) = mkls(tid, obsEmpty, ival, Val(gs.queue.head), value, optval) A User Theorem
disj-crashed-ready ⊦ crashed ≠ ready An Axiom
disj-DoDeq-InvDeq ⊦ DoDeq(tid) ≠ InvDeq(tid0) An Axiom
disj-RetDeq-RetEnq ⊦ RetDeq(tid, optval) ≠ RetEnq(tid0) An Axiom
updsel--dotqueue-dotqueue ⊦ (gs.queue:= queue).queue = queue An Axiom
lstepf-resEnq-RETENQ ⊦ lstepf(gs, ls, resEnq, RetEnq(ls.tid)) = ls An Axiom
disj-RetDeq-callRun ⊦ RetDeq(tid, optval) ≠ callRun(tid0) An Axiom
updsel--dotobsEmpty-dotobsEmpty ⊦ (ls.obsEmpty:= obsEmpty).obsEmpty ↔ obsEmpty An Axiom
updsel--dotoval-dotobsEmpty ⊦ (ls.oval:= oval).obsEmpty ↔ ls.obsEmpty An Axiom
lstepf-ready-INVENQ ⊦ lstepf(gs, ls, ready, InvEnq(ls.tid, value)) = ls.ival:= value An Axiom
disj-DoEnq-InvEnq ⊦ DoEnq(tid) ≠ InvEnq(tid0, val) An Axiom
disj-DoEnq-RetDeq ⊦ DoEnq(tid) ≠ RetDeq(tid0, optval) 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 = callRun(ls.tid) An Axiom
DQInv ⊦ DQInv(gs, lsf, pcf) ↔ DQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid))) An Axiom
updsel--dotvalue-dotvalue ⊦ (ls.value:= ival0).value = ival0 An Axiom
disj-RetEnq-globalCrash ⊦ RetEnq(tid) ≠ globalCrash An Axiom
disj-invDeq-resEnq ⊦ invDeq ≠ resEnq An Axiom
gen-DQGStateDQGState freely generated by mkgs; An Axiom
sel-DoEnq-dottid ⊦ DoEnq(tid).tid = tid An Axiom
updsel--dotoval-dottid ⊦ (ls.oval:= oval).tid = ls.tid An Axiom
lstepf-CheckEmp ⊦ lstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, CheckEmp(tid)) = mkls(tid, true, ival, oval, value, optval) A User Theorem
updsel--dotvalue-dotival ⊦ (ls.value:= ival0).ival = ls.ival An Axiom
DQGInv ⊦ DQGInv(gs) ↔ true An Axiom
updsel--dottid-dotoptval ⊦ (ls.tid:= tid).optval = ls.optval An Axiom
updsel--dotobsEmpty-dotvalue ⊦ (ls.obsEmpty:= obsEmpty).value = ls.value An Axiom
gstepf-invDeq-CHECKEMP ⊦ gstepf(gs, ls, invDeq, CheckEmp(ls.tid)) = gs An Axiom
disj-idle-invDeq ⊦ idle ≠ invDeq An Axiom
gstepf-RetDeq ⊦ gstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), resDeq, RetDeq(tid, oval)) = gs A User Theorem
sel-mkstate-dotlsf ⊦ mkstate(gstate, lsf, pcf).lsf = lsf An Axiom
pcstepf-RetEnq ⊦ pcstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), resEnq, RetEnq(tid)) = ready A User Theorem
disj-DoDeqEmpty-RetEnq ⊦ DoDeqEmpty(tid) ≠ RetEnq(tid0) An Axiom
case-DQAction⊦ a = CheckEmp(a.tid) ∨ a = DoDeq(a.tid) ∨ a = DoDeqEmpty(a.tid) ∨ a = DoEnq(a.tid) ∨ a = InvDeq(a.tid) ∨ a = InvEnq(a.tid, a.val) ∨ a = RetDeq(a.tid, a.optval) ∨ a = RetEnq(a.tid) ∨ a = callRun(a.tid) ∨ a = globalCrash ∨ a = τ 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
pcstepf-ready-INVENQ ⊦ pcstepf(gs, ls, ready, InvEnq(ls.tid, value)) = invEnq An Axiom
lstepf-invDeq-DODEQEMPTY ⊦ lstepf(gs, ls, invDeq, DoDeqEmpty(ls.tid)) = ls.oval:= Empty An Axiom
sel-mkls-dotvalue ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0 An Axiom
updsel--dotgstate-dotlsf ⊦ (s.gstate:= gstate).lsf = s.lsf An Axiom
disj-DoEnq-tau ⊦ DoEnq(tid) ≠ τ An Axiom
disj-DoEnq-globalCrash ⊦ DoEnq(tid) ≠ globalCrash An Axiom
lstepf-InvDeq ⊦ lstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvDeq(tid)) = mkls(tid, false, ival, oval, value, optval) A User Theorem
sel-callRun-dottid ⊦ callRun(tid).tid = tid An Axiom
upd-mkls-dotival ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival:= ival1 = mkls(tid, obsEmpty, ival1, oval, ival0, oval0) An Axiom
disj-crashed-invDeq ⊦ crashed ≠ invDeq An Axiom
disj-idle-ready ⊦ idle ≠ ready An Axiom
disj-DoDeq-globalCrash ⊦ DoDeq(tid) ≠ globalCrash An Axiom
disj-CheckEmp-tau ⊦ CheckEmp(tid) ≠ τ An Axiom
pcstepf-invDeq-CHECKEMP ⊦ pcstepf(gs, ls, invDeq, CheckEmp(ls.tid)) = invDeq An Axiom
inj-RetDeq ⊦ RetDeq(tid, optval) = RetDeq(tid0, optval0) ↔ tid = tid0 ∧ optval = optval0 An Axiom
lstepf-invEnq-DOENQ ⊦ lstepf(gs, ls, invEnq, DoEnq(ls.tid)) = ls An Axiom
updsel--dottid-dotival ⊦ (ls.tid:= tid).ival = ls.ival An Axiom
gstepf-resDeq-RETDEQ ⊦ gstepf(gs, ls, resDeq, RetDeq(ls.tid, ls.oval)) = gs An Axiom
updsel--dotlsf-dotlsf ⊦ (s.lsf:= lsf).lsf = lsf An Axiom
sel-mkgs-dotqueue ⊦ mkgs(queue).queue = queue An Axiom
case-DQState ⊦ mkstate(s.gstate, s.lsf, s.pcf) = s An Axiom
upd-mkls-dotoval ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval:= oval1 = mkls(tid, obsEmpty, ival, oval1, ival0, oval0) An Axiom
disj-CheckEmp-DoDeqEmpty ⊦ CheckEmp(tid) ≠ DoDeqEmpty(tid0) An Axiom
updsel--dotoptval-dotvalue ⊦ (ls.optval:= oval0).value = ls.value An Axiom
gen-DQActionDQAction freely generated by globalCrash, τ, CheckEmp, DoDeq, DoDeqEmpty, DoEnq, InvDeq, InvEnq, RetDeq, RetEnq, callRun; An Axiom
disj-CheckEmp-InvDeq ⊦ CheckEmp(tid) ≠ InvDeq(tid0) An Axiom
updsel--dotival-dottid ⊦ (ls.ival:= ival).tid = ls.tid An Axiom
pcstepf-DoDeqEmpty ⊦ pcstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeqEmpty(tid)) = resDeq A User Theorem
sel-InvEnq-dotval ⊦ InvEnq(tid, val).val = val An Axiom
pre-resDeq ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval) An Axiom
disj-ready-resEnq ⊦ ready ≠ resEnq An Axiom
updsel--dotgstate-dotgstate ⊦ (s.gstate:= gstate).gstate = gstate An Axiom
disj-RetEnq-tau ⊦ RetEnq(tid) ≠ τ An Axiom
disj-CheckEmp-DoEnq ⊦ CheckEmp(tid) ≠ DoEnq(tid0) An Axiom
lstepf-DoEnq ⊦ lstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invEnq, DoEnq(tid)) = mkls(tid, obsEmpty, ival, oval, value, optval) A User Theorem
inj-DoDeq ⊦ DoDeq(tid) = DoDeq(tid0) ↔ tid = tid0 An Axiom
pcstepf-invDeq-DODEQEMPTY ⊦ pcstepf(gs, ls, invDeq, DoDeqEmpty(ls.tid)) = resDeq An Axiom
pcstepf-invEnq-DOENQ ⊦ pcstepf(gs, ls, invEnq, DoEnq(ls.tid)) = resEnq An Axiom
gstepf-DoEnq ⊦ gstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invEnq, DoEnq(tid)) = gs.queue:= (gs.queue + ival) A User Theorem
gstepf-resEnq-RETENQ ⊦ gstepf(gs, ls, resEnq, RetEnq(ls.tid)) = gs An Axiom
pcstepf-DoDeq ⊦ pcstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeq(tid)) = resDeq A User Theorem
disj-idle-resEnq ⊦ idle ≠ resEnq An Axiom
pcstepf-callRun ⊦ pcstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), idle, callRun(tid)) = ready A User Theorem
disj-invDeq-invEnq ⊦ invDeq ≠ invEnq An Axiom
pre-crashed ⊦ pre(gs, ls, crashed, a) ↔ false An Axiom
disj-RetDeq-globalCrash ⊦ RetDeq(tid, optval) ≠ globalCrash An Axiom
upd-mkls-dotoptval ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval:= oval2 = mkls(tid, obsEmpty, ival, oval, ival0, oval2) An Axiom
disj-DoDeqEmpty-DoEnq ⊦ DoDeqEmpty(tid) ≠ DoEnq(tid0) An Axiom
disj-DoDeq-DoDeqEmpty ⊦ DoDeq(tid) ≠ DoDeqEmpty(tid0) An Axiom
disj-DoEnq-RetEnq ⊦ DoEnq(tid) ≠ RetEnq(tid0) An Axiom
disj-DoEnq-callRun ⊦ DoEnq(tid) ≠ callRun(tid0) An Axiom
lstepf-invDeq-DODEQ ⊦ lstepf(gs, ls, invDeq, DoDeq(ls.tid)) = ls.oval:= Val(gs.queue.head) An Axiom
pre-ready ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid) An Axiom
updsel--dotoval-dotoval ⊦ (ls.oval:= oval).oval = oval An Axiom
updsel--dotoval-dotival ⊦ (ls.oval:= oval).ival = ls.ival An Axiom
inj-mkstate ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0 An Axiom
sel-mkls-dotoptval ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0 An Axiom
pcstepf-idle-Run ⊦ pcstepf(gs, ls, idle, callRun(ls.tid)) = ready An Axiom
disj-InvEnq-RetDeq ⊦ InvEnq(tid, val) ≠ RetDeq(tid0, optval) An Axiom
DQstep⊦ DQstep(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 = globalCrash ∧ ⟨Crash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf) An Axiom
updsel--dotoptval-dotobsEmpty ⊦ (ls.optval:= oval0).obsEmpty ↔ ls.obsEmpty An Axiom
disj-crashed-resEnq ⊦ crashed ≠ resEnq An Axiom
updsel--dotpcf-dotgstate ⊦ (s.pcf:= pcf).gstate = s.gstate An Axiom
inj-InvEnq ⊦ InvEnq(tid, val) = InvEnq(tid0, val0) ↔ tid = tid0 ∧ val = val0 An Axiom
updsel--dotpcf-dotlsf ⊦ (s.pcf:= pcf).lsf = s.lsf An Axiom
disj-crashed-idle ⊦ crashed ≠ idle An Axiom
pcstepf-invDeq-DODEQ ⊦ pcstepf(gs, ls, invDeq, DoDeq(ls.tid)) = resDeq An Axiom
disj-DoDeq-InvEnq ⊦ DoDeq(tid) ≠ InvEnq(tid0, val) An Axiom
lstepf-InvEnq ⊦ lstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvEnq(tid, value0)) = mkls(tid, obsEmpty, value0, oval, value, optval) A User Theorem
gstepf-idle-Run ⊦ gstepf(gs, ls, idle, callRun(ls.tid)) = gs An Axiom
disj-invEnq-resDeq ⊦ invEnq ≠ resDeq An Axiom
disj-DoDeqEmpty-InvDeq ⊦ DoDeqEmpty(tid) ≠ InvDeq(tid0) An Axiom
lstepf-RetDeq ⊦ lstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), resDeq, RetDeq(tid, oval)) = mkls(tid, obsEmpty, ival, oval, value, oval) A User Theorem
disj-DoDeq-RetDeq ⊦ DoDeq(tid) ≠ RetDeq(tid0, optval) An Axiom
disj-crashed-invEnq ⊦ crashed ≠ invEnq An Axiom
DQstep-def0⊦ DQstep(mkstate(gs, lsf, pcf), a, dqs0) ↔ (a = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ dqs0 = 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
pcstepf-InvDeq ⊦ pcstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvDeq(tid)) = invDeq A User Theorem
inj-callRun ⊦ callRun(tid) = callRun(tid0) ↔ tid = tid0 An Axiom
gen-DQPCDQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq; An Axiom
sel-DoDeq-dottid ⊦ DoDeq(tid).tid = tid An Axiom
pre-invDeq ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ [] An Axiom
disj-InvDeq-tau ⊦ InvDeq(tid) ≠ τ An Axiom
upd-mkstate-dotpcf ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0) An Axiom
disj-invDeq-ready ⊦ invDeq ≠ ready An Axiom
inj-CheckEmp ⊦ CheckEmp(tid) = CheckEmp(tid0) ↔ tid = tid0 An Axiom
elim-mkgs ⊦ queue = gs.queue ↔ gs = mkgs(queue) An Axiom
gstepf-invEnq-DOENQ ⊦ gstepf(gs, ls, invEnq, DoEnq(ls.tid)) = gs.queue:= (gs.queue + ls.ival) An Axiom
disj-DoDeqEmpty-tau ⊦ DoDeqEmpty(tid) ≠ τ An Axiom
upd-mkls-dotobsEmpty ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).obsEmpty:= obsEmpty0 = mkls(tid, obsEmpty0, ival, oval, ival0, oval0) An Axiom
gstepf-RetEnq ⊦ gstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), resEnq, RetEnq(tid)) = gs A User Theorem
disj-InvEnq-callRun ⊦ InvEnq(tid, val) ≠ callRun(tid0) An Axiom
disj-callRun-globalCrash ⊦ callRun(tid) ≠ globalCrash An Axiom
disj-idle-invEnq ⊦ idle ≠ invEnq An Axiom
disj-DoDeqEmpty-globalCrash ⊦ DoDeqEmpty(tid) ≠ globalCrash An Axiom
pcstepf-DoEnq ⊦ pcstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invEnq, DoEnq(tid)) = resEnq A User Theorem
updsel--dotvalue-dotoptval ⊦ (ls.value:= ival0).optval = ls.optval An Axiom
sel-RetEnq-dottid ⊦ RetEnq(tid).tid = tid An Axiom
pcstepf-CheckEmp ⊦ pcstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, CheckEmp(tid)) = invDeq A User Theorem
sel-mkstate-dotpcf ⊦ mkstate(gstate, lsf, pcf).pcf = pcf An Axiom
updsel--dotlsf-dotgstate ⊦ (s.lsf:= lsf).gstate = s.gstate An Axiom
case-DQPC ⊦ pc = crashed ∨ pc = idle ∨ pc = invDeq ∨ pc = invEnq ∨ pc = ready ∨ pc = resDeq ∨ pc = resEnq An Axiom
disj-InvEnq-globalCrash ⊦ InvEnq(tid, val) ≠ globalCrash An Axiom
sel-InvEnq-dottid ⊦ InvEnq(tid, val).tid = tid An Axiom
inj-RetEnq ⊦ RetEnq(tid) = RetEnq(tid0) ↔ tid = tid0 An Axiom
disj-InvEnq-RetEnq ⊦ InvEnq(tid, val) ≠ RetEnq(tid0) An Axiom
updsel--dottid-dotobsEmpty ⊦ (ls.tid:= tid).obsEmpty ↔ ls.obsEmpty An Axiom
upd-mkls-dotvalue ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value:= ival2 = mkls(tid, obsEmpty, ival, oval, ival2, oval0) An Axiom
upd-mkstate-dotgstate ⊦ (mkstate(gstate, lsf, pcf).gstate:= gstate0) = mkstate(gstate0, lsf, pcf) An Axiom
lstepf-invDeq-CHECKEMP ⊦ lstepf(gs, ls, invDeq, CheckEmp(ls.tid)) = ls.obsEmpty:= true An Axiom
disj-DoEnq-InvDeq ⊦ DoEnq(tid) ≠ InvDeq(tid0) An Axiom
updsel--dotvalue-dottid ⊦ (ls.value:= ival0).tid = ls.tid An Axiom
disj-CheckEmp-RetDeq ⊦ CheckEmp(tid) ≠ RetDeq(tid0, optval) An Axiom
sel-mkls-dotobsEmpty ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).obsEmpty ↔ obsEmpty An Axiom
updsel--dotoval-dotoptval ⊦ (ls.oval:= oval).optval = ls.optval An Axiom
inj-mkgs ⊦ mkgs(queue) = mkgs(queue0) ↔ queue = queue0 An Axiom
DQLInv ⊦ DQLInv(gs, ls, pc) ↔ true An Axiom
disj-CheckEmp-InvEnq ⊦ CheckEmp(tid) ≠ InvEnq(tid0, val) An Axiom
lstepf-ready-INVDEQ ⊦ lstepf(gs, ls, ready, InvDeq(ls.tid)) = ls.obsEmpty:= false An Axiom
gstepf-invDeq-DODEQ ⊦ gstepf(gs, ls, invDeq, DoDeq(ls.tid)) = gs.queue:= gs.queue.tail An Axiom
disj-DoDeq-tau ⊦ DoDeq(tid) ≠ τ An Axiom
gstepf-CheckEmp ⊦ gstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, CheckEmp(tid)) = gs A User Theorem
pcstepf-resEnq-RETENQ ⊦ pcstepf(gs, ls, resEnq, RetEnq(ls.tid)) = ready An Axiom
pcstepf-RetDeq ⊦ pcstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), resDeq, RetDeq(tid, oval)) = ready A User Theorem
upd-mkgs-dotqueue ⊦ mkgs(queue).queue:= queue0 = mkgs(queue0) An Axiom
disj-DoDeq-DoEnq ⊦ DoDeq(tid) ≠ DoEnq(tid0) An Axiom
disj-DoDeq-RetEnq ⊦ DoDeq(tid) ≠ RetEnq(tid0) An Axiom
sel-mkls-dotoval ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval An Axiom
disj-DoDeqEmpty-callRun ⊦ DoDeqEmpty(tid) ≠ callRun(tid0) An Axiom
disj-DoDeqEmpty-RetDeq ⊦ DoDeqEmpty(tid) ≠ RetDeq(tid0, optval) An Axiom
pre-resEnq ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid) An Axiom
disj-DoDeqEmpty-InvEnq ⊦ DoDeqEmpty(tid) ≠ InvEnq(tid0, val) An Axiom
gstepf-callRun ⊦ gstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), idle, callRun(tid)) = gs A User Theorem
pcstepf-ready-INVDEQ ⊦ pcstepf(gs, ls, ready, InvDeq(ls.tid)) = invDeq An Axiom
inj-DoEnq ⊦ DoEnq(tid) = DoEnq(tid0) ↔ tid = tid0 An Axiom
disj-invEnq-resEnq ⊦ invEnq ≠ resEnq An Axiom
inj-mkls⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0) = mkls(tid0, obsEmpty0, ival1, oval1, ival2, oval2) ↔ tid = tid0 ∧ (obsEmpty ↔ obsEmpty0) ∧ ival = ival1 ∧ oval = oval1 ∧ ival0 = ival2 ∧ oval0 = oval2 An Axiom
disj-DoDeq-callRun ⊦ DoDeq(tid) ≠ callRun(tid0) An Axiom
disj-RetDeq-tau ⊦ RetDeq(tid, optval) ≠ τ An Axiom
sel-mkls-dottid ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid An Axiom
updsel--dotobsEmpty-dottid ⊦ (ls.obsEmpty:= obsEmpty).tid = ls.tid An Axiom
sel-RetDeq-dotoptval ⊦ RetDeq(tid, optval).optval = optval An Axiom
elim-mkls⊦ ((((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval) An Axiom
disj-InvDeq-RetDeq ⊦ InvDeq(tid) ≠ RetDeq(tid0, optval) An Axiom
updsel--dotobsEmpty-dotoptval ⊦ (ls.obsEmpty:= obsEmpty).optval = ls.optval An Axiom
updsel--dotival-dotoptval ⊦ (ls.ival:= ival).optval = ls.optval An Axiom
updsel--dotival-dotobsEmpty ⊦ (ls.ival:= ival).obsEmpty ↔ ls.obsEmpty An Axiom
CrashCrash(; pcf){pcf := λ tid. (pcf(tid) = idle ⊃ idle;crashed)} An Axiom
updsel--dottid-dottid ⊦ (ls.tid:= tid).tid = tid An Axiom
updsel--dotgstate-dotpcf ⊦ (s.gstate:= gstate).pcf = s.pcf An Axiom
lstepf-callRun ⊦ lstepf(gs, mkls(tid, obsEmpty, ival, oval, value, optval), idle, callRun(tid)) = mkls(tid, obsEmpty, ival, oval, value, optval) A User Theorem
disj-InvDeq-InvEnq ⊦ InvDeq(tid) ≠ InvEnq(tid0, val) An Axiom
disj-CheckEmp-globalCrash ⊦ CheckEmp(tid) ≠ globalCrash An Axiom