Abstract
In this paper, we present the formal verification of a Common Lisp implementation of Buchberger’s algorithm for computing Gröbner bases of polynomial ideals. This work is carried out in the Acl2 system and shows how verified Computer Algebra can be achieved in an executable logic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
Buchberger, B., Winkler, F. (eds.): Gröbner Bases and Applications. London Mathematical Society Series, vol. 251 (1998)
Coquand, T., Persson, H.: Gröbner Bases in Type Theory. In: Altenkirch, T., Naraschewski, W., Reus, B. (eds.) TYPES 1998. LNCS, vol. 1657, pp. 33–46. Springer, Heidelberg (1999)
Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer, Dordrecht (1998)
Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer, Dordrecht (2000)
Kaufmann, M., Moore, J.S.: Structured Theory Development for a Mechanized Logic. Journal of Automated Reasoning 26(2), 161–203 (2001)
Martín, F.J., Alonso, J.A., Hidalgo, M.J., Ruiz, J.L.: A Formal Proof of Dickson’s Lemma in ACL2. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol. 2850, pp. 49–58. Springer, Heidelberg (2003)
Medina, I., Alonso, J.A., Palomo, F.: Automatic Verification of Polynomial Rings Fundamental Properties in ACL2. ACL2 Workshop 2000. Department of Computer Sciences, University of Texas at Austin. TR–00–29 (2000)
Medina, I., Palomo, F., Alonso, J.A.: Implementation in ACL2 of Well-Founded Polynomial Orderings. In: ACL2 Workshop 2002 (2002)
Rudnicki, P., Schwarzweller, C., Trybulec, A.: Commutative Algebra in the Mizar System. Journal of Symbolic Computation 32(1-2), 143–169 (2001)
Ruiz, J.L., Alonso, J.A., Hidalgo, M.J., Martín, F.J.: Formal Proofs about Rewriting using ACL2. Annals of Mathematics and Artificial Intelligence 36(3), 239–262 (2002)
Sustyk, M.: Proof of Dickson’s Lemma Using the ACL2 Theorem Prover via an Explicit Ordinal Mapping. In: Fourth International Workshop on the ACL2 Theorem Prover and Its Applications (2003)
Théry, L.: A Machine-Checked Implementation of Buchberger’s Algorithm. Journal of Automated Reasoning 26(2), 107–137 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Medina-Bulo, I., Palomo-Lozano, F., Alonso-Jiménez, J.A., Ruiz-Reina, J.L. (2004). Verified Computer Algebra in Acl2 . In: Buchberger, B., Campbell, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 2004. Lecture Notes in Computer Science(), vol 3249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30210-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30210-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23212-4
Online ISBN: 978-3-540-30210-0
eBook Packages: Springer Book Archive