Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    A Formal Proof of Dickson’s Lemma in ACL2

    Dickson’s Lemma is the main result needed to prove the termination of Buchberger’s algorithm for computing Gröbner basis of polynomial ideals. In this case study, we present a formal proof of Dickson’s Lemma u...

    F. J. Martın-Mateos, J. A. Alonso in Logic for Programming, Artificial Intellig… (2003)

  2. No Access

    Chapter and Conference Paper

    Verification in ACL2 of a Generic Framework to Synthesize SAT-Provers

    We present in this paper an application of the ACL2 system to reason about propositional satisfiability provers. For that purpose, we present a framework where we define a generic transformation based SAT-prov...

    F. J. Martín-Mateos, J. A. Alonso in Logic Based Program Synthesis and Transfor… (2003)