[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 37 from proof fsync-dirs (previous step)

files0[m] = mkfile(m0, md0, m1, content), err = ESUCCESS, m ∈ files0, m2 ≤ n * VFS_PAGE_SIZE ⊦ [icache_check_inode#(m, icache; asynced0, asynced, err); inode := mkinode(m, md, false, m1, 0, m2); ino := m; if err = ESUCCESS ∧ asynced0 ∧ asynced then icache_get#(ino, icache; asynced0, inode, err); dirs := dirs0; if err = ESUCCESS ∧ asynced0 ∧ asynced then afs_write_inode#(inode; err, dirs, files; asynced1); if err = ESUCCESS then {asynced := false; icache_set_status#(ino, asynced; err, icache)}; if err = ESUCCESS then afs_fsync#(inode, false, dirs, files; ; asynced2, err)] (dirs = dirs0)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 38:
files0[m] = mkfile(m0, md0, m1, content), err = ESUCCESS, ino = m, m ∈ files0, m2 ≤ n * VFS_PAGE_SIZE ⊦ [if ino ∈ icache then {asynced0 := true; asynced := icache[ino].dirty} else asynced0 := false; inode := mkinode(m, md, false, m1, 0, m2); ino := m; if err = ESUCCESS ∧ asynced0 ∧ asynced then icache_get#(ino, icache; asynced0, inode, err); dirs := dirs0; if err = ESUCCESS ∧ asynced0 ∧ asynced then afs_write_inode#(inode; err, dirs, files; asynced1); if err = ESUCCESS then {asynced := false; icache_set_status#(ino, asynced; err, icache)}; if err = ESUCCESS then afs_fsync#(inode, false, dirs, files; ; asynced2, err)] (dirs = dirs0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: icache_check_inode#(INO, ICACHE; HIT, DIRTY, ERR) {if INO ∈ ICACHE then {HIT := true; DIRTY := ICACHE[INO].dirty} else HIT := false };