A Machine-Checked Implementation of Buchberger's Algorithm

We present an implementation of Buchberger's algorithm that has been proved correct within the proof assistant Coq. The implementation contains the basic algorithm plus two standard optimizations.

[1]  Yves Bertot,et al.  CtCoq: A System Presentation , 1996, AMAST.

[2]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[3]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[4]  Lawrence C. Paulson,et al.  Constructing Recursion Operators in Intuitionistic Type Theory , 1986, J. Symb. Comput..

[5]  Bruno Buchberger,et al.  A survey of the Theorema project , 1997, ISSAC.

[6]  Yves Bertot,et al.  CtCoq: A System Presentation , 1996, AMAST.

[7]  Stephen Wolfram,et al.  Mathematica: a system for doing mathematics by computer (2nd ed.) , 1991 .

[8]  B. Buchberger.  Gröbner Bases and Applications: Introduction to Gröbner Bases , 1998 .

[9]  Piotr Rudnicki,et al.  An Overview of the MIZAR Project , 1992 .

[10]  Keith O. Geddes,et al.  Algorithms for computer algebra , 1992 .

[11]  Jacques Calmet,et al.  Classification of Communication and Cooperation Mechanisms for Logical and Symbolic Computation Systems , 1996, FroCoS.

[12]  Gilles Kahn,et al.  Extracting Text from Proofs , 1995, TLCA.

[13]  Robert L. Constable,et al.  Expressing Computational Complexity in Constructive Type Theory , 1994, LCC.

[14]  Laurent Théry,et al.  A Certified Version of Buchberger's Algorithm , 1998, CADE.

[15]  Natarajan Shankar,et al.  PVS: Combining Specification, Proof Checking, and Model Checking , 1996, FMCAD.

[16]  Christine Paulin-Mohring,et al.  Synthesis of ML Programs in the System Coq , 1993, J. Symb. Comput..

[17]  Paul B. Jackson.  Enhancing the NUPRL Proof Development System and Applying it to Computational Abstract Algebra , 1995 .

[18]  R. Fateman,et al.  A System for Doing Mathematics by Computer. , 1992 .

[19]  William M. Farmer,et al.  Little Theories , 1992, CADE.

[20]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[21]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[22]  Natarajan Shankar.  PVS: Combining Specification, Proof Checking, and Model Checking , 1996, FMCAD.

[23]  Jaime G. Carbonell,et al.  Automated Deduction — CADE-16 , 2002, Lecture Notes in Computer Science.

[24]  MA John Harrison PhD.  Theorem Proving with the Real Numbers , 1998, Distinguished Dissertations.

[25]  Andrej Bauer,et al.  Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation , 1996, Journal of Automated Reasoning.

[26]  V. Menissier-Morain.  The CAML numbers reference manual , 1992 .

[27]  Christine Paulin-Mohring,et al.  The Coq Proof Assistant : A Tutorial : Version 7.2 , 1997 .

[28]  Christoph Schwarzweller.  MIZAR verification of generic algebraic algorithms , 1997 .

[29]  John Harrison,et al.  A Skeptic's Approach to Combining HOL and Maple , 1998, Journal of Automated Reasoning.