A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Connecting Gröbner Bases Programs with Coq to do Proofs in Algebra, Geometry and Arithmetics

2008
*
Logic Programming and Automated Reasoning
*

We describe how we connected three programs that compute Gröbner bases [1] to Coq [11], to do automated proofs on algebraic, geometrical and arithmetical expressions. The result is a set of Coq tactics and a certificate mechanism 1 . The programs are: F4 [5], GB [4], and gbcoq [10]. F4 and GB are the fastest (up to our knowledge) available programs that compute Gröbner bases. Gbcoq is slow in general but is proved to be correct (in Coq), and we adapted it to our specific problem to be

dblp:conf/lpar/Pottier08
fatcat:ofbhqipo4ve6jmwg5vc3ojstxu