[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 afs-cons-init
⊦ afs-cons((∅ ++ ROOT_INO)[ROOT_INO, mkdir(0, md, 0, 0, ∅)], ∅)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
cache-asm
,
afs-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 7
Used lemmas:
subdirs
,
links
,
afs-cons
,
Used spec theorems:
set-basic
/alink-set/
Extension
set-basic
/dir-entries/
Extension
Used simplifier rules:
abstract-dir
/
sel-08
store
/dir-entries/
Size-empty
abstract-dir
/
sel-03
abstract-dir
/
sel-05
heap
/file-heap/
in-emp
set-basic
/alink-set/
size-zero-01
set-basic
/alink-set/
size-zero
set-basic
/alink-set/
In-empty
set-basic
/dir-entries/
size-zero-01
set-basic
/dir-entries/
size-zero
heap
/dir-heap/
in-write
root-ino
/
neq-0
heap
/dir-heap/
in-emp
heap
/dir-heap/
in-alloc
heap
/dir-heap/
at-write
abstract-dir
/
sel-09
store
/dir-entries/
In-empty
set-basic
/dir-entries/
In-empty