[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
,
Proof step 2 from proof crash-neutral-set (
previous step
)
⊦ ⟨let key = dentrykey(p_ino, name) in dcache[key] := dent⟩ true
Heuristic symbolic execution applied rule let right
And obtained the following new goals
Proof step 3
:
key = dentrykey(p_ino, name) ⊦ ⟨dcache[key] := dent⟩ true
Rule argument
Additional information