[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 94 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, ¬ datakey(m, pageno) ∈ pcache, asynced2 → synced(files, icache, pcache) ⊦ ⟪fail#(; ; err); if err = ESUCCESS ∧ buf ≠ zeropage then let asynced = false in pcache_set#(m, pageno, buf, asynced; err, pcache)⟫ (pcache-cons(pcache, dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced2 → synced(files, icache, pcache)))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 95:
# 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, asynced2 → synced(files, icache, pcache) ⊦ ⟪choose err0 with ⌊err0⌋ in err := err0; if err = ESUCCESS ∧ buf ≠ zeropage then let asynced = false in pcache_set#(m, pageno, buf, asynced; err, pcache)⟫ (pcache-cons(pcache, dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced2 → synced(files, icache, pcache))), datakey(m, pageno) ∈ pcache

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail#(; ; ERR){choose ERR0 with ⌊ERR0⌋ in ERR := ERR0};