Verified Computer Algebra in Acl2

  • I. Medina-Bulo
  • F. Palomo-Lozano
  • J. A. Alonso-Jiménez
  • J. L. Ruiz-Reina
Conference paper

DOI: 10.1007/978-3-540-30210-0_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3249)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • I. Medina-Bulo
    • 1
  • F. Palomo-Lozano
    • 1
  • J. A. Alonso-Jiménez
    • 2
  • J. L. Ruiz-Reina
    • 2
  1. 1.Depto. de Lenguajes y Sistemas InformáticosUniv. de Cádiz, E.S. de Ingeniería de CádizCádizEspaña
  2. 2.Depto. de Ciencias de la Computación e Inteligencia ArtificialUniv. de Sevilla, E.T.S. de Ingeniería InformáticaSevillaEspaña

Personalised recommendations