[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 py-prefix
⊦ ispath(q, ino, m, dirs, files) ∧ py(user, p, tree, abs-files(files)) ∧ q ⊑ p ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → px(user, q, ino, dirs, files)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
refine-create
,
refine-link
,
refine-mkdir
,
refine-rmdir
,
refine-unlink
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
fid-file
,
path-in-eq
,
path-in
,
Used spec theorems:
path-permission
/vfs-permission/
px
vfs-abs
/
abs-meta-h
path-permission
/posix-permission/
py
path-permission
/posix-permission/
px
Used simplifier rules:
afs-base
/
isexpath
list-last
/path/
prefix-trans
afs-base
/
afs-cons-notfile
heap-sep
/dir-heap/
emp-sep
heap-sep
/dir-heap/
sep-ass
heap-sep
/dir-heap/
sep-com
afs-base
/
path-prefix
afs-base
/
path-in-dirs