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

dom of < ino, afs-cons(dirs, files), of-cons(of, dirs, files) ⊦ ⟪let ino = ROOT_INO, dent = negdentry(p.last), p = parent(p), isdir = false, 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_unlink#(; 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)), p = ε

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Proof step 8:
isdir ↔ false, dent = negdentry(p0.last), ino = ROOT_INO, p = parent(p0), dom of < ino0, afs-cons(dirs, files), of-cons(of, dirs, files) ⊦ ⟪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_unlink#(; 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)), p0 = ε
Proof step 304:
dom of < ino, afs-cons(dirs, files), of-cons(of, dirs, files) ⊦ p = ε, p ≠ ε ∧ p ≠ ε

Proof step 7 from proof inv-unlink (previous step)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information