[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 CIOAut-lem
⊦ CIOAut?(CIOAut(DMSQinit, DMSQstep))
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 13
Used lemmas:
exlsf-tidok
,
Used spec theorems:
DMSQ
/
unbounded-memory
abs
/
DMSQinit-def
Used simplifier rules:
IO-Automaton
/DMSQ-Automaton-absAction/
isIOAut-def
store
/Node-heap/
In-empty
DMSQ
/
sel-mkgs-dotowns
DMSQ
/
sel-mkgs-dotpretRefs
DMSQ
/
sel-mkgs-dotvretRefs
DMSQ
/
sel-mkgs-dotprvHp
DMSQ
/
sel-mkgs-dotvrvHp
store
/Node-heap/
eq-put2
DMSQ
/
sel-mkgs-dotps
DMSQ
/
sel-mkgs-dotvs
DMSQ
/
sel-mkgs-dotqrl
list
/reflist/
c-04
DMSQ
/
sel-mkgs-dotorl
DMSQ
/
sel-mkgs-dotvtail
DMSQ
/
sel-mkgs-dotvhead
DMSQ
/
sel-mkgs-dotphead
Node
/
inj-mk
DMSQ
/
elim-mkls
DMSQ
/
sel-mkls-dottid