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

dom of < ino, afs-cons(dirs, files), of-cons(of, dirs, files) ⊦ ⟪vfs_rmdir#(p, user, of; err, dirs, files, asynced)⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))

User applied rule call right

And obtained the following new goals

Proof step 4:
⊦
Proof step 5:
dom of < ino, afs-cons(dirs, files), of-cons(of, dirs, files) ⊦ ⟪if p = ε then err := EACCESS else let ino = ROOT_INO, dent = negdentry(p.last), p = parent(p), isdir = true, inode = ?, p_inode = ? in {vfs_walk#(p, user, dirs, files, asynced; ino, err); if err = ESUCCESS then vfs_may_delete_check#(ino, user, dirs, files, asynced; inode, isdir, dent, p_inode, err); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {afs_rmdir#(; inode, p_inode, dent, err, dirs, files; asynced); vfs_put_inode#(p_inode, of, asynced; err, dirs, files)}}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))

Rule argument

pos: right 1

Additional information

Used simplifier rules: rmdir: ⊦ ;