Polynomial function intervals for floating-point software verification
The focus of our work is the verification of tight functional properties of numerical programs, such as showing that a floating-point implementation of Riemann integration computes a close approximation of the exact integral. Programmers and engineers writing such progr...
34 references, page 1 of 4
views in local repository
downloads in local repository
The information is available from the following content providers: