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



View long theorem info. View the proof. 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,

Proof step 52 from proof inv-remove (previous step)

jvalid ↔ key ∈ fi, gstore = gstore1, gstore0 = gstore2, ¬ jvalid, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, p_os < pmaxino, fi.inos < jmaxino, fi0.inos < pmaxino, inv(gstore2 \ jro), inv(gstore1), refsize-cons(gstore2, range fi), refsize-cons(gstore1, range fi0), ri-inj(fi), ri-inj(fi0), pmaxino ≤ jmaxino, fi.lebs ⊆ dom gstore2, fi0.lebs ⊆ dom gstore1, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪skip⟫ ( fi.inos < jmaxino ∧ (jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro)) ∧ fi.lebs ⊆ dom gstore2 ∧ refsize-cons(gstore2, range fi) ∧ inv(gstore2 \ jro) ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ jro), pmaxino = 0, dups(nx)

Heuristic symbolic execution applied rule skip right

And closed the goal!

Rule argument

Additional information