Proving formally the implementation of an efficient gcd algorithm for polynomials
Résumé
We 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.
Domaines
Logique en informatique [cs.LO]
Loading...