Proving formally the implementation of an efficient gcd algorithm for polynomials

Last version published in the proceedings of IJCAR 06, part of FLOC 06.International audienceWe describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correction of our implementation of the subresultant algorithm. Up to our knowledge, it is the first mechanized proof of this result