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

# buf = VFS_PAGE_SIZE, afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache), m ∈ files, asynced → synced(files, icache, pcache) ⊦ ⟪cache_readpage#(mkinode(m, md, boolvar, m0, m1, m2), pageno, dirs, files, asynced0; buf, err, pcache)⟫ (pcache-cons(pcache, dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced → synced(files, icache, pcache)))

User applied rule call right

And obtained the following new goals

Proof step 6:
# buf = VFS_PAGE_SIZE, asynced1 ↔ asynced0, inode = mkinode(m, md, boolvar, m0, m1, m2), afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache), m ∈ files, asynced → synced(files, icache, pcache) ⊦ ⟪if pre-readpage(inode, pageno, buf, dirs, files) then let asynced0 = false, ino = inode.ino in {pcache_get#(ino, pageno, pcache; asynced0, buf, err); if ¬ asynced0 ∨ err ≠ ESUCCESS then {afs_readpage#(inode, pageno, dirs, files, asynced1; buf, err); if err = ESUCCESS ∧ buf ≠ zeropage then let asynced = false in pcache_set#(ino, pageno, buf, asynced; err, pcache)}} else abort⟫ (pcache-cons(pcache, dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced → synced(files, icache, pcache)))

Rule argument

pos: right 1

Additional information

Used simplifier rules: readpage: ⊦ ;