Proving formally the implementation of an efficient gcd algorithm for polynomials
In: Automated Reasoning, Third International Joint Conference, IJCAR 2006 ; https://hal.inria.fr/inria-00001270 ; Automated Reasoning, 2006
Online
Konferenz
Zugriff:
Last version published in the proceedings of IJCAR 06, part of FLOC 06. ; International audience ; 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.
Titel: |
Proving formally the implementation of an efficient gcd algorithm for polynomials
|
---|---|
Autor/in / Beteiligte Person: | Mahboubi, Assia ; Mathematical, Reasoning and Software (MARELLE) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria) ; Ulrich Furbach and Natarajan Shankar |
Link: | |
Zeitschrift: | Automated Reasoning, Third International Joint Conference, IJCAR 2006 ; https://hal.inria.fr/inria-00001270 ; Automated Reasoning, 2006 |
Veröffentlichung: | HAL CCSD ; Springer, 2006 |
Medientyp: | Konferenz |
Schlagwort: |
|
Sonstiges: |
|