[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 kadane-correct (previous step)

⊦ ⟪let size = # a, max_so_far = 0, max_ending_here = 0, n = 0 in {while n < size do {/* kadane-correct : invariant 0 ≤ max_ending_here ∧ max_ending_here ≤ max_so_far ∧ n ≤ size ∧ maximum-sum(subarray(a, 0, n), max_so_far) ∧ (∃ m. maximum-suffix-sum(subarray(a, 0, n), m, max_ending_here)) wfbound size - n; */; max_ending_here := max_ending_here + a[n]; if max_ending_here < 0 then max_ending_here := 0 else if max_so_far < max_ending_here then max_so_far := max_ending_here; n := n + 1}; res := max_so_far}⟫ maximum-sum(a, res)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Proof step 3:
max_ending_here = 0, max_so_far = 0, n = 0, size = # a ⊦ ⟪while n < size do {/* kadane-correct : invariant 0 ≤ max_ending_here ∧ max_ending_here ≤ max_so_far ∧ n ≤ size ∧ maximum-sum(subarray(a, 0, n), max_so_far) ∧ (∃ m. maximum-suffix-sum(subarray(a, 0, n), m, max_ending_here)) wfbound size - n; */; max_ending_here := max_ending_here + a[n]; if max_ending_here < 0 then max_ending_here := 0 else if max_so_far < max_ending_here then max_so_far := max_ending_here; n := n + 1}; res := max_so_far⟫ maximum-sum(a, res)

Proof step 2 from proof kadane-correct (previous step)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information