[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 862 from proof refine-truncate-buff-none-uncached (previous step)

VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[m1] = mkfile(m0, md0, # links(m1, cache_dirs), content0), cache_files[m1] = mkfile(m3, md1, # links(m1, cache_dirs), content), 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), key ∈ cache_pcache, m1 ∈ cache_files, m2 / VFS_PAGE_SIZE ∈ content, m2 ≤ m, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ m2 % VFS_PAGE_SIZE = 0, key.data?, datakey(m1, m2 / VFS_PAGE_SIZE) ∈ cache_pcache

Heuristic use patterns applied rule insert rewrite lemma

And obtained the following new goals

Proof step 863:
⊦ pcache-cons(pcache, dirs, files) ↔ (∀ key. key ∈ pcache → key.data? ∧ # pcache[key].page = VFS_PAGE_SIZE ∧ valid-file-ino(key.ino, dirs, files) ∧ (¬ pcache[key].dirty → key.part ∈ files[key.ino].content ∧ pcache[key].page = files[key.ino].content[key.part]))
Proof step 864:
VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, cache_files[m1] = mkfile(m3, md1, # links(m1, cache_dirs), content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[m1] = mkfile(m0, md0, # links(m1, cache_dirs), content0), 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), synced(cache_dirs, cache_icache, cache_pcache), m2 / VFS_PAGE_SIZE ∈ content, m1 ∈ cache_files, key ∈ cache_pcache, m2 ≤ m, cache_sync → synced(cache_files, cache_icache, cache_pcache), ∀ key. key ∈ cache_pcache → key.data? ∧ # cache_pcache[key].page = VFS_PAGE_SIZE ∧ valid-file-ino(key.ino, cache_dirs, cache_files) ∧ (¬ cache_pcache[key].dirty → key.part ∈ cache_files[key.ino].content ∧ cache_pcache[key].page = cache_files[key.ino].content[key.part]) ⊦ m2 % VFS_PAGE_SIZE = 0, key.data?, datakey(m1, m2 / VFS_PAGE_SIZE) ∈ cache_pcache

Rule argument

spec: cache-base name: pcache-cons seq: ⊦ pcache-cons(pcache, dirs, files) ↔ (∀ key. key ∈ pcache → key.data? ∧ # pcache[key].page = VFS_PAGE_SIZE ∧ valid-file-ino(key.ino, dirs, files) ∧ ( ¬ pcache[key].dirty → key.part ∈ files[key.ino].content ∧ pcache[key].page = files[key.ino].content[key.part])) subst: [pcache, dirs, files] → [cache_pcache, cache_dirs, cache_files] flags: <all paths>

Additional information

Used terms: cache_pcache, cache_dirs, cache_files