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

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

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 62:
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]))

Rule argument

pos: right 1

Additional information

Used simplifier rules: icache_set_status#(INO, DIRTY; ERR, ICACHE) {if INO ∈ ICACHE then ICACHE[INO].dirty := DIRTY else ERR := EFAIL};