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

fs = abs-files(files), err1 ≠ ESUCCESS, root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), psynced → asynced, ⌊err1⌋ ∨ err1 = ENOENT ∧ ¬ ispath(path, ROOT_INO, dirs, files) ∨ err1 = EACCESS ∧ path ≠ ε ∧ p' ⊑ parent(path) ∧ ispath(p', ROOT_INO, dirs, files) ∧ ¬ px(user, p', ROOT_INO, dirs, files) ⊦ ⟨posix_writemeta#(path, md, user, abs-of(of); err0, root, fs; psynced)⟩ (fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err1 = err0)

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 215:
fs = abs-files(files), ofh = abs-of(of), root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), psynced → asynced, ⌊err1⌋ ∨ err1 = ENOENT ∧ ¬ ispath(path, ROOT_INO, dirs, files) ∨ err1 = EACCESS ∧ path ≠ ε ∧ p' ⊑ parent(path) ∧ ispath(p', ROOT_INO, dirs, files) ∧ ¬ px(user, p', ROOT_INO, dirs, files) ⊦ ⟨choose err with pre-writemeta(path, md, err, user, root, fs, ofh) in err0 := err; if err0 = ESUCCESS then if root[path].dir? then root[path].meta := md else let fid = root[path].fid in fs[fid].meta := md; psynced := ?⟩ (fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err1 = err0), err1 = ESUCCESS

Rule argument

pos: right 1

Additional information

Used simplifier rules: posix_writemeta#(PATH, MD, USER, OFH; ERR, ROOT, FS; PSYNCED) {choose E with pre-writemeta(PATH, MD, E, USER, ROOT, FS, OFH) in ERR := E; if ERR = ESUCCESS then if ROOT[PATH].dir? then ROOT[PATH].meta := MD else let FID = ROOT[PATH].fid in FS[FID].meta := MD; PSYNCED := ? };