[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 kadane-correct
⊦ ⟪maxSubArraySum#(a; ; res)⟫ maximum-sum(a, res)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 21
Used lemmas:
max-sub-array-sum
,
Used spec theorems:
Used simplifier rules:
int-array-ops
/
max-sum-empty-array
array-copy
/int-array/
subarray-zero
nat
/
lez
int-array-ops
/
suffix-max-sum-empty-array
int-array-ops
/
max-sum-next-less-zero
int-abs
/
zero-gels-01
int-basic2
/
ls
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-array-ops
/
suffix-max-sum-reset
int-abs
/
forward-le-05
int-basic2
/
ls-02
int-abs
/
forward-lels
int-array-ops
/
max-sum-new-current-max
int-abs
/
ler
int-abs
/
lep-02
int-array-ops
/
suffix-max-sum-step
nat-basic
/
f
int-abs
/
forward-lele
int-abs
/
forward-le-01
nat-basic
/
ref
nat-basic
/
s-04
nat
/
prop-07
nat
/
ls-01
int-array-ops
/
max-sum-keep-current-max
nat
/
ls-le-simp
int-basic2
/
add-c
int-basic2
/
add-a
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
int-abs
/
zero-gels-04
int-abs
/
lels
nat
/
lels-03
nat
/
lels-02
nat-basic
/
neq-01
nat-basic
/
ls-02
array-copy
/int-array/
subarray-elim
nat
/
lels
nat
/
anti