[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 decode-contract
⊦ ⟪decode#(n, buf; a, n0; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → is-encoded(a, subarray(buf, n, n0)) ∧ n + n0 ≤ # buf ∧ n0 = encoding-size(a)))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
encoding-fixed-size-nonempty
,
encoding-aligned
,
Proof exists?: No