Skip to main content
Journal Article

Verified Computer Algebra in ACL2 (Gröbner Bases Computation)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3249 171-184
DOI: 10.1007/978-3-540-30210-0_15
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present the formed 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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Medina-Bulo, I., Palomolozano, F., Alonso-Jiménez, J. A., & Ruiz-Reina, J. L. (2004). Verified Computer Algebra in ACL2 (Gröbner Bases Computation). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3249, 171–184. https://doi.org/10.1007/978-3-540-30210-0_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free