[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 pcache-entry

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:
sel-01 ⊦ mkpentry(boolvar, buf).page = buf An Axiom
sel-02 ⊦ mkpentry(boolvar, buf).dirty ↔ boolvar An Axiom
upd-01 ⊦ mkpentry(boolvar, buf).page:= buf0 = mkpentry(boolvar, buf0) An Axiom
upd-02 ⊦ mkpentry(boolvar, buf).dirty:= boolvar0 = mkpentry(boolvar0, buf) An Axiom
updsel-01 ⊦ (pe.page:= buf).page = buf An Axiom
updsel-02 ⊦ (pe.dirty:= boolvar).page = pe.page An Axiom
updsel-03 ⊦ (pe.page:= buf).dirty ↔ pe.dirty An Axiom
updsel-04 ⊦ (pe.dirty:= boolvar).dirty ↔ boolvar An Axiom
inj ⊦ mkpentry(boolvar, buf) = mkpentry(boolvar0, buf0) ↔ (boolvar ↔ boolvar0) ∧ buf = buf0 An Axiom
case ⊦ mkpentry(pe.dirty, pe.page) = pe An Axiom
elim ⊦ (boolvar ↔ pe.dirty) ∧ buf = pe.page ↔ pe = mkpentry(boolvar, buf) An Axiom
genpcache-entry freely generated by mkpentry; An Axiom