[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 datakeys
⊦ key ∈ datakeys(key0, ri) ↔ key ∈ ri ∧ key.data? ∧ key0.inode? ∧ key.ino = key0.ino
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
at-del-ro-data
,
at-del-ro-nodata
,
data-at-del-datakeys
,
datakeys-0
,
datakeys-del-dentry
,
datakeys-put-inode-01
,
datakeys-set-add
,
datakeys-set-del
,
dentry-at-del-datakeys
,
in-del-ro
,
inode-at-del-datakeys
,
Used by units in proved state:
aubifs-inv
,
Proof exists?: No