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

# buf0 = VFS_PAGE_SIZE, cache_files[ino] = mkfile(m9, md2, # links(ino, cache_dirs), content0), cache_icache[m] = mkientry(boolvar, mkinode(m0, md, false, m1, m2, m4)), cache_files[m] = mkfile(m3, md0, # links(m, cache_dirs), content), content[pageno] = (content ⊕ mkcontent(m, cache_pcache))[pageno], cache_icache[ino] = mkientry(boolvar0, mkinode(m5, md1, false, m6, m7, m8)), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), ino ∈ cache_icache, pageno ∈ content, m ∈ cache_files, m ∈ cache_icache, ino ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ n ∈ content0 ⊕ mkcontent(ino, cache_pcache) ↔ n ∈ content0 ⊕ mkcontent(ino, cache_pcache[datakey(m, pageno), mkpentry(false, content[pageno])]), content[pageno] = zeropage, datakey(m, pageno) ∈ cache_pcache

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 403:
⊦ n ∈ content0 ⊕ content1 ↔ n ∈ content0 ∨ n ∈ content1
Proof step 404:
# buf0 = VFS_PAGE_SIZE, cache_icache[ino] = mkientry(boolvar0, mkinode(m5, md1, false, m6, m7, m8)), content[pageno] = (content ⊕ mkcontent(m, cache_pcache))[pageno], cache_files[m] = mkfile(m3, md0, # links(m, cache_dirs), content), cache_icache[m] = mkientry(boolvar, mkinode(m0, md, false, m1, m2, m4)), cache_files[ino] = mkfile(m9, md2, # links(ino, cache_dirs), content0), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), ino ∈ cache_files, m ∈ cache_icache, m ∈ cache_files, pageno ∈ content, ino ∈ cache_icache, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ n ∈ content0 ⊕ mkcontent(ino, cache_pcache) ↔ n ∈ content0 ∨ n ∈ mkcontent(ino, cache_pcache[datakey(m, pageno), mkpentry(false, content[pageno])]), content[pageno] = zeropage, datakey(m, pageno) ∈ cache_pcache

Rule argument

spec: cache-base name: in-overwrite-content seq: ⊦ n ∈ content0 ⊕ content1 ↔ n ∈ content0 ∨ n ∈ content1 subst: [content1, content0, n] → [mkcontent (ino, cache_pcache [datakey(m, pageno), mkpentry(false, content[pageno]) ]), content0, n] flags: <all paths>

Additional information

Used terms: mkcontent (ino, cache_pcache[datakey(m, pageno), mkpentry(false, content[pageno])]), content0, n