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: |
|---|---|---|
| aabs-AInvEnq | ⊦ aabs(AInvEnq(tid, val)) = InvENQ(tid, val) | An Axiom |
| bwsim-step | ⊦ bwabs(mkstate(gs0, lsf0, pcf0), durqs0) ∧ DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ∧ DQInv(gs, lsf, pcf) ∧ fininvdeq(pcf) ∧ a = absa(ca, durqs0.pcf) → (∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)) | A User Theorem |
| bwsim-step-nontau | bwabs(mkstate(gs0, lsf0, pcf0), durqs0), absa(ca, durqs0.pcf) ≠ τ, DQInv(gs, lsf, pcf), fininvdeq(pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ⊦ ∃ durqs. DurQstep(durqs, absa(ca, durqs0.pcf), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) | A User Theorem |
| bwsim-step-tau | bwabs(mkstate(gs0, lsf0, pcf0), durqs), DQInv(gs, lsf, pcf), fininvdeq(pcf), absa(ca, durqs.pcf) = τ, DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ⊦ bwabs(mkstate(gs, lsf, pcf), durqs) | A User Theorem |
| aabs-ADoDeq | ⊦ aabs(ADoDeq(tid)) = τ | An Axiom |
| DurQstep | ⊦ DurQstep(durqs, aa, durqs0) ↔ (∃ a. DurQstep(durqs, a, durqs0) ∧ aa = aabs(a)) | An Axiom |
| fininvdeq | ⊦ fininvdeq(pcf) ↔ (∃ tids. ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids) | An Axiom |
| DQINV-Step | ⊦ DQINV(dqs) ∧ DQstep(dqs, ca, dqs0) → DQINV(dqs0) | A User Theorem |
| aabs-AResDeq | ⊦ aabs(ARetDeq(tid, optval)) = ResDEQ(tid, optval) | An Axiom |
| imfin-lemma-aux | ⊦ ∃ ass0. ∀ as0. as0 ∈ ass0 ↔ (∃ as. as ∈ ass ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) | A User Theorem |
| DQ-Automaton | ⊦ CIOAut?(CIOAut(DQinit, DQstep)) | A User Theorem |
| refines | ⊦ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)) | A User Theorem |
| aabs-DurQtau | ⊦ aabs(τ) = τ | An Axiom |
| bwsim | ⊦ imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)) | A User Theorem |
| aabs-ADoEnq | ⊦ aabs(ADoEnq(tid)) = τ | An Axiom |
| DurQinit | ⊦ DurQinit(durqs) ↔ durqs.gstate.queue = [] ∧ (∀ tid. durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid) | An Axiom |
| absa-def | ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) | An Axiom |
| DQstep | ⊦ DQstep(dqs, aa, dqs0) ↔ (∃ ca. DQstep(dqs, ca, dqs0) ∧ aa = aabs(ca)) | An Axiom |
| aabs-AInvDeq | ⊦ aabs(AInvDeq(tid)) = InvDEQ(tid) | An Axiom |
| DQINV-Init | ⊦ DQinit(dqs) → DQINV(dqs) | A User Theorem |
| DurQ-Automaton | ⊦ AIOAut?(AIOAut(DurQinit, DurQstep)) | A User Theorem |
| DQINV-def | ⊦ DQINV(dqs) ↔ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf) | An Axiom |
| aabs-AResEnq | ⊦ aabs(ARetEnq(tid)) = ResENQ(tid) | An Axiom |
| imfin-lemma | ∀ tid. tid ∈ tids ↔ pcf(tid) = invDeq, DQInv(gs, lsf, pcf), tids0 ⊆ tids ⊦ ∃ ass. ∀ as. bwabs(mkstate(gs, lsf, pcf), as) ∧ DurQInv(as.gstate, as.lsf, as.pcf) ∧ (∀ tid. ¬ tid ∈ tids0 → as.pcf(tid) = bwabspcf(pcf(tid)) ∧ as.lsf(tid) = bwlabsf(lsf(tid))) ↔ as ∈ ass | A User Theorem |
| aabs-Acrash | ⊦ aabs(globalACrash) = globalCRASH | An Axiom |
| DQinit | ⊦ DQinit(dqs) ↔ dqs.gstate.queue = [] ∧ (∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid) | An Axiom |
| imfin-lemma-aux-old | ⊦ ∃ ass0. ∀ as0. as0 ∈ ass0 ↔ (∃ as. as ∈ ass ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ as.pcf:= as.pcf(tid; resDeq);as)) | A User Theorem |
| bwrefines | ⊦ ≤iBI(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)) | A User Theorem |
| aabs-callARun | ⊦ aabs(callARun(tid)) = CallRUN(tid) | An Axiom |