[Imprint][Data Privacy Statement][E-Mail]

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,

Lemma dependency for Specification int-array-ops

A lemma (entry) may depend on lemmas (entries) below its position, but never on lemmas above its position. This means the list is a topological order of the dependency graph. An entry 'all subs proved' means that all used lemmas are (transitively) proved.

Name: Status: Subs proved? Used:
suffix-max-sum-stepprovedall subs proved sum-zero, suffix-upper-bound-reduce, sum-succ, sum-subarray, maximum-suffix-sum,
suffix-max-sum-resetprovedall subs proved sum-succ, suffix-upper-bound-reduce, sum-zero, sum-subarray, maximum-suffix-sum,
max-sum-next-less-zeroprovedall subs proved sum-succ, sum-zero, upper-bound, upper-bound-reduce, sum-subarray, maximum-sum-bounds, maximum-sum,
max-sum-new-current-maxprovedall subs proved upper-bound, sum-zero, suffix-upper-bound, upper-bound-reduce, sum-succ, maximum-suffix-sum, sum-subarray, maximum-sum-bounds, maximum-sum,
max-sum-keep-current-maxprovedall subs proved sum-succ, upper-bound, sum-zero, suffix-upper-bound, upper-bound-reduce, maximum-suffix-sum, sum-subarray, maximum-sum-bounds, maximum-sum,
suffix-upper-bound-reduceprovedall subs proved suffix-upper-bound,
sum-subarrayprovedall subs proved sum-succ, sum-zero,
upper-bound-reduceprovedall subs proved upper-bound,
suffix-max-sum-empty-arrayprovedall subs proved suffix-upper-bound, sum-zero, maximum-suffix-sum,
max-sum-empty-arrayprovedall subs proved upper-bound, sum-zero, maximum-sum-bounds, maximum-sum,
maximum-suffix-sumaxiom
suffix-upper-boundaxiom
sum-succaxiom
maximum-sumaxiom
maximum-sum-boundsaxiom
sum-zeroaxiom
upper-boundaxiom