Novel Approaches to Numerical Software with Result Verification.
Laurent Granvilliers, Владик Крейнович, Norbert Müller · 2003
Abstract. Traditional design of numerical software with result verification is based on the assumption that we know the algorithm ¦¨§� © ©���� £��������� � that transforms inputs © ©�� into �� � £��������� � ©���� the output, and we £��������� � know the intervals of possible values of the inputs. Many real-life problems go beyond this paradigm. In some cases, we do not have an algorithm ¦, we only know some relation (constraints) between ©� � and. In other cases, in addition to knowing the intervals, we may know some relations between; we may have some information about the probabilities of different values of © � , and we may know the exact values of some of the inputs (e.g., we may know that © £ ���¨�� �). In this paper, we describe the approaches for solving these real-life problems. In Section 2, we describe interval consistency techniques related to handling constraints;