[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 inv-crash
dirs = dirs0 \ orphans(dirs0, files) ∧ files0 = files \ orphans(dirs0, files), afs-cons(dirs0, files) ⊦ ⟪skip⟫ ((true → afs-cons(dirs, files0)) ∧ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: copied,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 10
Used lemmas:
afs-cons-reduce
,
Used spec theorems:
afs-base
/
orphans
Used simplifier rules:
heap
/file-heap/
at-diffs
afs-base
/
subdirs-delete-orphans
heap
/file-heap/
in-diffs
heap
/dir-heap/
at-diffs
afs-base
/
afs-cons-links-rmorphans
afs-base
/
root-not-orphan
afs-base
/
afs-cons-root-dir
heap
/dir-heap/
in-diffs
afs-base
/
valid-pagesize
afs-base
/
dir-empty
abstract-file
/
elim
afs-base
/
afs-cons-pagesize
abstract-dir
/
elim
afs-base
/
afs-cons-links-empty
set-basic
/alink-set/
size-zero-01
abstract-dir
/
sel-05
store
/dir-entries/
In-empty
store
/dir-entries/
Size-empty
afs-base
/
afs-cons-dir-nlink
afs-base
/
afs-cons-notfile
afs-base
/
valid-ino
afs-base
/
links-nonempty