Abstract : Numerical integration is commonly available in numerical computation systems. We study in this thesis the error on the result of a numerical quadrature using the Newton-Cotes and Gauss-Legendre methods for a monodimensional real function in the context of arbitrary precision. From the algorithmic point of view we give for each method a computation procedure with a guaranteed bound on the error. For the analysis of the Gauss-Legendre method we studied polynomial root refinement schemes (secante, Newton's iteration, dichotomy) and we gave heuristics to make sure the method converges in practice. The algorithms proposed in this thesis were written in a numerical quadrature library called "Correctly Rounded Quadrature" (CRQ) available at http://komite.net/laurent/soft/crq/. We also give a comparison of CRQ with other numerical integration softwares.