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

of[fd] = mkfile(m, mode, m0), err = ESUCCESS, ino = m, inode = p_inode, dom of < ino0, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of ⊦ ⟪{inode := getinode(ino, dirs, files); err := ESUCCESS} or fail#(; ; err); if err = ESUCCESS then {of := of -- fd; vfs_put_inode#(inode, of, asynced; err, dirs, files)}⟫ (of-cons(of, dirs, files) ∧ dom of < ino0 ∧ afs-cons(dirs, files))

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Proof step 17:
of[fd] = mkfile(m, mode, m0), err = ESUCCESS, ino = m, inode = p_inode, dom of < ino0, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of ⊦ ⟪inode := getinode(ino, dirs, files); err := ESUCCESS; if err = ESUCCESS then {of := of -- fd; vfs_put_inode#(inode, of, asynced; err, dirs, files)}⟫ (of-cons(of, dirs, files) ∧ dom of < ino0 ∧ afs-cons(dirs, files))
Proof step 36:
of[fd] = mkfile(m, mode, m0), err = ESUCCESS, ino = m, inode = p_inode, dom of < ino0, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of ⊦ ⟪fail#(; ; err); if err = ESUCCESS then {of := of -- fd; vfs_put_inode#(inode, of, asynced; err, dirs, files)}⟫ (of-cons(of, dirs, files) ∧ dom of < ino0 ∧ afs-cons(dirs, files))

Proof step 16 from proof inv-close (previous step)

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information