Determining the optimal interval between check points in a program

Assuming a simplest possible structure of checkable feedbacks in a program the interval between neighboring check points (an elementary program segment) is determined which isures mimization of the mean problem solution time. A strategy is proposed for finding the size of the segment with the proviso that the problem should be solved with a specified probability within a specified time interval.