Chapter

Current Topics in Artificial Intelligence

Volume 3040 of the series Lecture Notes in Computer Science pp 344-353

Formal Verification of Molecular Computational Models in ACL2: A Case Study

  • Francisco J. Martín-MateosAffiliated withUniversity of SurreyComputational Logic Group, Dept. of Computer Science and Artificial Intelligence, University of Seville, E.T.S.I. Informática
  • , José A. AlonsoAffiliated withUniversity of SurreyComputational Logic Group, Dept. of Computer Science and Artificial Intelligence, University of Seville, E.T.S.I. Informática
  • , Maria José HidalgoAffiliated withUniversity of SurreyComputational Logic Group, Dept. of Computer Science and Artificial Intelligence, University of Seville, E.T.S.I. Informática
  • , José Luis Ruiz-ReinaAffiliated withUniversity of SurreyComputational Logic Group, Dept. of Computer Science and Artificial Intelligence, University of Seville, E.T.S.I. Informática

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Theorem proving is a classical AI problem with a broad range of applications. Since its complexity is exponential in the size of the problem, many methods to parallelize the process has been proposed. One of these approaches is based on the massive parallelism of molecular reactions. ACL2 is an automated theorem prover especially adequate for algorithm verification. In this paper we present an ACL2 formalization of a molecular computational model: Adleman’s restricted model. As an application of this model, an implementation of Lipton’s experiment solving SAT is described. We use ACL2 to make a formal proof of the completeness and soundness properties of this implementation.