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

  • Francisco J. Martín-Mateos
  • José A. Alonso
  • Maria José Hidalgo
  • José Luis Ruiz-Reina
Conference paper

DOI: 10.1007/978-3-540-25945-9_34

Volume 3040 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Martín-Mateos F.J., Alonso J.A., Hidalgo M.J., Ruiz-Reina J.L. (2004) Formal Verification of Molecular Computational Models in ACL2: A Case Study. In: Conejo R., Urretavizcaya M., Pérez-de-la-Cruz JL. (eds) Current Topics in Artificial Intelligence. Lecture Notes in Computer Science, vol 3040. Springer, Berlin, Heidelberg

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.

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

  • Francisco J. Martín-Mateos
    • 1
  • José A. Alonso
    • 1
  • Maria José Hidalgo
    • 1
  • José Luis Ruiz-Reina
    • 1
  1. 1.Computational Logic Group, Dept. of Computer Science and Artificial IntelligenceUniversity of Seville, E.T.S.I. InformáticaSevillaSpain