Finite precision computations may affect the stability of iterative algorithms and the accuracy of computed solutions. Automatic approaches are proposed to control these effects as for example, the CESTAC and the CENA methods. We focus here on a complementary use of these two methods to localize unstable behavior of the algorithm, improve its stability and the accuracy of the solutions. We present computational experiments on ill-conditioned polynomial roots approximated with Newton's iteration.