[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 11 from proof refine-commit (previous step)

err = err0, remove-refsize0(gstore1) = gstore1, dom remove-refsize0(gstore2) ∩ jro0 = ∅, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jro1.keys.inodes?, p_os.keys.inodes?, jro1 < jmaxino, p_os < pmaxino, ri.inos < jmaxino, fi1.inos < pmaxino, inv(gstore2 \ jro0), inv(gstore1), log-cons(abs-log(nx, gstore2 ↓), nodes(gstore2 ↓, jro0)), refsize-cons(gstore2, range ri), refsize-cons(gstore1, range fi1), ri-cons(ri, nodes(gstore2 ↓, jro0)), ri-inj(ri), ri-inj(fi1), pmaxino ≤ jmaxino, ri.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, jvalid2 → jvalid0, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS then jvalid := true else jvalid := ?; log := abs-log(nx, gstore2 ↓); gstore0 := gstore2; fs := nodes(gstore2 ↓, jro0); fi := fi1; fo := p_os.keys; jvalid0 := jvalid; if err = ESUCCESS then let jro2 = jro1 in index_commit#(jmaxino, ri, jvalid0; jro2, jro0, gstore0, fi, gstore1, nx, pmaxino, p_os; err)⟫ ⟨aubifs_core_commit#(ri, jro1.keys; fs, fi1, fo, log; jvalid2, err1)⟩ (p_os.keys = fo ∧ fi = fi1 ∧ log = abs-log(nx, gstore0 ↓) ∧ fs = nodes(gstore0 ↓, jro0) ∧ (jvalid2 → jvalid0) ∧ err = err1), jmaxino = 0, pmaxino = 0, dups(nx)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information