[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 62 from proof fsync-inode-others-unchanged (previous step)

asynced ↔ false, files0[m0] = mkfile(m1, md0, m2, content), icache0[m] = mkientry(true, mkinode(m0, md, false, m2, 0, m3)), err = ESUCCESS, icache = icache1, icache1 = icache0, ino = m, icache-cons(icache0, dirs, files0), m0 ∈ files0, m ∈ icache0 ⊦ [if ino ∈ icache then icache[ino].dirty := asynced else err := EFAIL] (m0 = m ∧ (∀ ino. ino ≠ m ∧ ino ∈ files0 → (files0[m, (files0[m].meta:= md).size:= m3] ⊕ icache)[ino] = (files0 ⊕ icache0)[ino]))

Heuristic conditional right split applied rule if right

And obtained the following new goals

Proof step 63:
asynced ↔ false, icache0[m] = mkientry(true, mkinode(m0, md, false, m2, 0, m3)), files0[m0] = mkfile(m1, md0, m2, content), err = ESUCCESS, icache = icache1, icache1 = icache0, ino = m, icache-cons(icache0, dirs, files0), ino ∈ icache, m ∈ icache0, m0 ∈ files0 ⊦ [icache[ino].dirty := asynced] (m0 = m ∧ (∀ ino. ino ≠ m ∧ ino ∈ files0 → (files0[m, (files0[m].meta:= md).size:= m3] ⊕ icache)[ino] = (files0 ⊕ icache0)[ino]))
Proof step 72:
asynced ↔ false, icache0[m] = mkientry(true, mkinode(m0, md, false, m2, 0, m3)), files0[m0] = mkfile(m1, md0, m2, content), err = ESUCCESS, icache = icache1, icache1 = icache0, ino = m, icache-cons(icache0, dirs, files0), m ∈ icache0, m0 ∈ files0 ⊦ [err := EFAIL] (m0 = m ∧ (∀ ino. ino ≠ m ∧ ino ∈ files0 → (files0[m, (files0[m].meta:= md).size:= m3] ⊕ icache)[ino] = (files0 ⊕ icache0)[ino])), ino ∈ icache

Proof step 62 from proof fsync-inode-others-unchanged (previous step)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information