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

# buf0 = # buf1, files[m3] = mkfile(m1, md, # links(m3, dirs), content), of[fd] = mkfile(m3, mode0, m4), root.dir?, dom of < ino2, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), read-inv(m4, m4 + n, mkinode(m3, md, false, # links(m3, dirs), 0, m1), buf0, buf0, 0, dirs, files), read-inv(m4, m4 + n, buf0, buf1, 0, content), fd ∈ of, m3 ∈ files, m4 ≤ m1, n ≤ # buf1, ⌊err1⌋ , psynced → asynced ⊦ buf1 = buf0, mode0 ≠ MODE_R ∧ mode0 ≠ MODE_RW

User applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: vfs-contracts name: read-inv seq: ⊦ read-inv(n0, n1, buf0, buf1, n, content) ↔ ⌜buf1⌝ = ((content.stream from n0) to n) + (⌜buf0⌝ from n) subst: [content, n, buf1, buf0, n1, n0] → [content, 0, buf1, buf0, m4 + n, m4] flags: <all paths>

Additional information

Used simplifier rules: ⊦ σ0 to 0 = []; (s)% ⊦ σ0 from 0 = σ0; (s)% ⊦ [] + σ0 = σ0; (s)%append-assoc: ⊦ (σ0 + σ3) + σ4 = σ0 + σ3 + σ4; from specification stream[buffer-inf]% ⊦ ⌜buf0⌝ = ⌜buf1⌝ ↔ buf0 = buf1; (s) Used terms: content, 0, buf1, buf0, m4 + n, m4