[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 16 from proof replay-prog (previous step)

err0 = ESUCCESS, ks = fo, ri = fi, ro = fo, fo.inodes?, replay-safe(log, fs, fi ⊖ fo) ⊦ ⟪aubifs_replayorphans#(fi, fo, fs, log, true; ks, err0, ri, ro); boolvar := true; if err0 = ESUCCESS then aubifs_replaylog#(log, fi, ro, fo, fs, log, boolvar; err0, ri); if err0 = ESUCCESS then aubifs_core_journal_sync#(ri, fi, ro, fo, fs, log; ; boolvar, err0)⟫ ((err0 = ESUCCESS ∨ ⌊err0⌋ ) ∧ (err0 = ESUCCESS → ri = replay-log(log, fs, fi ⊖ fo) ∧ ro = ∅ ∧ boolvar))

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: <toplevel> name: replayorphans-prepost seq: ri = ri0, ro0 = ro, ks = ro, err = ESUCCESS, ks.inodes? ⊦ ⟪aubifs_replayorphans# (fi, fo, fs, log, boolvar; ks, err, ri, ro)⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ks = ro ∧ ro = ∅ ∧ ri = ri0 ⊖ ro0)) subst: [boolvar, log, fs, fo, fi, ro, ri, err, ks, ri0, ro0] → [true, log, fs, fo, fi, ro, ri, err0, ks, ri, ro] flags: <all paths>

Additional information