[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 42 from proof inv-fsync (previous step)

⟨vfs_walk#(p, user, dirs, files, asynced; ino1, err)⟩ (ino1 = ino0 ∧ err = ESUCCESS), # links(ino0, dirs) = files[ino0].nlink, files[ino0] = mkfile(m, md, files[ino0].nlink, content), err = ESUCCESS, ino1 = ROOT_INO, afs-cons(dirs, files), ispath(p, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), pr(user, md), px-parent(user, p, ROOT_INO, dirs, files), ino0 ∈ files, ¬ ino0 ∈ dirs ⊦ ⟪fail_or_success#(; ; err); choose bv with true in asynced := bv; if err = ESUCCESS then afs_sync#(dirs, files; ; asynced, err)⟫ true

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 43:
⟨vfs_walk#(p, user, dirs, files, asynced; ino1, err)⟩ (ino1 = ino0 ∧ err = ESUCCESS), # links(ino0, dirs) = m1, files[ino0] = mkfile(m, md, m1, content), files[ino0] = mkfile(m0, md0, m1, content0), err = ESUCCESS, ino1 = ROOT_INO, afs-cons(dirs, files), ispath(p, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), pr(user, md), px-parent(user, p, ROOT_INO, dirs, files), ino0 ∈ files ⊦ ⟪fail_or_success#(; ; err); choose bv with true in asynced := bv; if err = ESUCCESS then afs_sync#(dirs, files; ; asynced, err)⟫ true, ino0 ∈ dirs

Rule argument

spec: abstract-file name: elim seq: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content) subst: [af, m, md, m0, content] → [files[ino0], m0, md0, m1, content0]

Additional information

Used simplifier rules: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content); (elim) Used terms: files[ino0], m0, md0, m1, content0