[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
,
Theorem pcache-overwrite-read-page
⊦ ¬ datakey(ino, n) ∈ pcache ∧ ino ∈ files ∧ n ∈ files[ino].content → files ⊕ pcache[datakey(ino, n), mkpentry(false, files[ino].content[n])] = files ⊕ pcache
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 23
Used lemmas:
at-mkcontent
,
at-overwrite-content-old
,
at-overwrite-content-new
,
in-mkcontent
,
in-overwrite-content
,
at-pcache-overwrite
,
in-pcache-overwrite
,
Used spec theorems:
heap
/file-heap/
ext
abstract-file
/
inj
store
/file-content/
Extension
store
/pcache/
In-insert
Used simplifier rules:
abstract-file
/
elim
store
/pcache/
notmemlookup
pcache-entry
/
elim
abstract-file
/
inj
store
/pcache/
In-insert
pcache-entry
/
inj
store
/pcache/
At-same
key
/
inj-02
store
/pcache/
in-neq
store
/pcache/
At-other
pcache-entry
/
sel-01