[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 27 from proof fsync-pages-keep-abs (previous step)

pcache[datakey(m, n)] = mkpentry(true, buf0), asynced0, err = ESUCCESS, (files ⊕ pcache) ⊕ icache = (files1 ⊕ pcache0) ⊕ icache, n * VFS_PAGE_SIZE < m2, pcache-cons(pcache0, dirs, files1), datakey(m, n) ∈ pcache ⊦ [pcache_get#(m, n, pcache; asynced0, buf, err); if err = ESUCCESS then afs_writepage#(mkinode(m, md, boolvar, m0, m1, m2), n, buf, dirs; err, files; asynced1); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced1); if err = ESUCCESS then {asynced := false; pcache_set_status#(m, n, asynced; err, pcache)}; n := n + 1] ((files1 ⊕ pcache0) ⊕ icache = (files ⊕ pcache) ⊕ icache)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 28:
asynced ↔ asynced0, pcache[datakey(m, n)] = mkpentry(true, buf0), asynced0, err = ESUCCESS, ino = m, pageno = n, (files ⊕ pcache) ⊕ icache = (files1 ⊕ pcache0) ⊕ icache, n * VFS_PAGE_SIZE < m2, pcache-cons(pcache0, dirs, files1), datakey(m, n) ∈ pcache ⊦ [let key = datakey(ino, pageno) in if key ∈ pcache then let pe = pcache[key] in {buf := pe.page; asynced := true} else asynced := false; err := ESUCCESS; if err = ESUCCESS then afs_writepage#(mkinode(m, md, boolvar, m0, m1, m2), n, buf, dirs; err, files; asynced1); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced1); if err = ESUCCESS then {asynced := false; pcache_set_status#(m, n, asynced; err, pcache)}; n := n + 1] ((files1 ⊕ pcache0) ⊕ icache = (files ⊕ pcache) ⊕ icache)

Rule argument

pos: right 1

Additional information

Used simplifier rules: pcache_get#(INO, PAGENO, PCACHE; HIT, BUF, ERR) {let KEY = datakey(INO, PAGENO) in if KEY ∈ PCACHE then let PE = PCACHE[KEY] in {BUF := PE.page; HIT := true} else HIT := false; ERR := ESUCCESS };