In computer science, you could prove it formally with a loop invariant, where you state that a desired property is maintained in your loop. Such a proof is broken down into the following parts: ...

package figures; public class Product { //@ requires A.length > 0; //@ ensures (\forall int i; i>=0 && i < A.length - 1; A[i] <= A[i+1]); public static void selection ...

Abstract: Verifiers that can prove programs correct against their full functional specification require, for programs with loops, additional annotations in the form of loop invariants-properties that ...

Abstract: Parallelization of programs relies on sound and precise analysis of data dependences in the code, specifically, when dealing with loops. State-of-art tools are based on dynamic profiling and ...