Skip to main content
Log in

A Machine-Checked Implementation of Buchberger's Algorithm

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bauer, A., Clarke, E. and Zhao, X.: Analytica-an experiment in combining theorem proving and symbolic computation, J. Automated Reasoning 21(3) (1998), 295–325.

    Google Scholar 

  2. Bertot, Y. and Bertot, J.: CtCoq: A system presentation, in Automated Deduction-CADE-13, Lecture Notes in Artif. Intell. 1104, Springer-Verlag, 1996.

  3. Buchberger, B.: Introduction to Gröbner bases, in B. Buchberger and F.Winkler (eds.), Gröbner Bases and Applications, Cambridge University Press, 1998, pp. 3–31.

  4. Buchberger, B., Jebelean, T., Kriftner, F., Marin, M., Tomuta, E. and Vasaru, D.: A survey on the theorema project, in International Symposium on Symbolic and Algebraic Computation (ISSAC'97), ACM, 1997.

  5. Calmet, J. and Homann, K.: Classification of communication and cooperation mechanisms for logical and symbolic computation systems, in First International Workshop 'Frontiers of Combining Systems' (FroCoS'96), Kluwer Series on Appl. Logic, Springer-Verlag, 1996, pp. 133–146.

  6. Constable, R. L.: Expressing computational complexity in constructive type theory, in International Workshop on Logic and Computational Complexity, Lecture Notes in Artif. Intell. 960, Springer-Verlag, July 1994.

  7. Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., Sasaki, J. T. and Smith, S. F.: Implementing Mathematics with Nuprl Proof Development System, Prentice-Hall, 1986.

  8. Coquand, T. and Persson, H.: Gröbner bases and type theory, in T. Altenkirch, W. Naraschewski, and B. Reus (eds.), Types for Proofs and Programs, Lecture Notes in Comput. Sci. 1657, Springer-Verlag, 1999.

  9. Coscoy, Y., Kahn, G. and Théry, L.: Extracting text from proofs, in Typed Lambda Calculus and Its Applications, Lecture Notes in Comput. Sci. 902, Springer-Verlag, 1995, pp. 109–123.

  10. Farmer, W. M., Guttman, J. D. and Thayer, F. J.: Little theories, in D. Kapur (ed.), Automated Deduction-CADE-11, Lecture Notes in Comput. Sci. 607, Springer-Verlag, 1992, pp. 567–581.

  11. Geddes, K. O., Czapor, S. R. and Labahn, G.: Algorithms for Computer Algebra, Kluwer Acad. Publ., 1992.

  12. Gordon, M. and Melham, T.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, Cambridge Univ. Press, 1993.

  13. Harrison, J. R.: Theorem Proving with the Real Numbers, Springer-Verlag, 1998.

  14. Harrison, J. R. and Théry, L.: A skeptic's approach to combining HOL and Maple, J. Automated Reasoning 21(3) (1998), 295–325.

    Google Scholar 

  15. Huet, G., Kahn, G. and Paulin-Mohring, C.: The Coq proof assistant: A tutorial: Version 6.1, Technical Report 204, INRIA, 1997.

  16. Jackson, P. B.: Enhancing the Nuprl proof development system and applying it to computational abstract algebra, Technical Report TR95–1509, Cornell University, 1995.

  17. Knuth, D. E. and Bendix, P. B: Simple word problems in universal algebras, in J. Leech (ed.), Computational Problems in Abstract Algebras, Pergamon Press, 1970.

  18. Ménissier-Morain, V.: The CAML numbers reference manual, Technical Report 141, INRIA, 1992.

  19. Nederpelt, R. P., Geuvers, J. H. and De Vrijer, R. C. (eds.): Selected Papers on Automath, North-Holland, 1994.

  20. Paulin-Mohring, C. and Werner, B.: Synthesis of ML programs in the system Coq, J. Symbolic Comput. 15(5–6) (1993), 607–640.

    Google Scholar 

  21. Paulson, L. C.: Constructing recursion operators in intuitionistic type theory, J. Symbolic Comput. 2(4) (1986), 325–355.

    Google Scholar 

  22. Paulson, L. C.: Isabelle: A Generic Theorem Prover, Lecture Notes in Comput. Sci. 828, Springer-Verlag, 1994.

  23. Pottier, L.: Dickson's lemma, Available at ftp://ftp-sop.inria.fr/lemme/Loic.Pottier/ MON/, 1996.

  24. Rudnicki, P.: An overview of the MIZAR projet, in Workshop on Types and Proofs for Programs, Available by ftp at pub/cs-reports/baastad.92/proc.ps.Z on ftp.cs.chalmers.se, 1992.

  25. Rushby, J. M., Shankar, N. and Srivas, M.: PVS: Combining specification, proof checking, and model checking, in CAV '96, Lecture Notes in Comput. Sci. 1102, Springer-Verlag, July 1996.

  26. Schwarzweller, C.: Mizar verification of generic algebraic algorithms, Ph.D. Thesis, Wilhelm-Schickard Institute for Computer Science, University of Tübingen, 1997.

  27. Théry, L.: A certified version of Buchberger's algorithm, in Automated Deduction-CADE-15, Lecture Notes in Artif. Intell. 1421, Springer-Verlag, 1998, pp. 349–364.

  28. Vega, G. P. and Werner, B.: Personal communication, 1998.

  29. Wolfram, S.: Mathematica: A System for Doing Mathematics by Computer, Addison-Wesley, 1988.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Théry, L. A Machine-Checked Implementation of Buchberger's Algorithm. Journal of Automated Reasoning 26, 107–137 (2001). https://doi.org/10.1023/A:1026518331905

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026518331905

Navigation