3 research outputs found
Verified Computer Algebra in ACL2 (Gröbner Bases Computation)
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