Advertisement

Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment

  • C. Graciani Díaz
  • F. J. Martín Mateos
  • Mario J. Pérez Jiménez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2509)

Abstract

The aim of this paper is to develop an executable prototype of an unconventional model of computation. Using the PVS verifica- tion system (an interactive environment for writing formal specifications and checking formal proofs), we formalize the restricted model, based on DNA, due to L. Adleman. Also, we design a formal molecular program in this model that solves SAT following Lipton’s ideas. We prove using PVS the soundness and completeness of this molecular program. This work is intended to give an approach to the opportunities offered by mecha nized analysis of unconventional model of computation in general. This approach opens up new possibilities of verifying molecular experiments before implementing them in a laboratory.

Keywords

Conjunctive Normal Form Restricted Model Propositional Variable Truth Assignment Propositional Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Leonard M. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021–1024, November 11, 1994.Google Scholar
  2. 2.
    Leonard M. Adleman. On constructing a molecular computer. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996. DNA Based Computers.Google Scholar
  3. 3.
    Judy Crow, Sam Owre, John Rushby, Natarajan Shankar, and Mandayam Srivas. A tutorial introduction to PVS. Presented at WIFT’ 95: Workshop on Industrial-Strength Formal Specification Techniques, Boca Raton, Florida, April 1995. Available, with specification files, at http://www.csl.sri.com/papers/wift-tutorial/.
  4. 4.
    M.J. Pérez Jiménez, F. Sancho Caparrini, M.C. Graciani Díaz, and A. Romero Jiménez. Soluciones moleculares del problema SAT de la Lógica Proposicional. In Lógica, Lenguaje e Información, JOLL’2000, pages 243–252. Ed. Kronos, 2000.Google Scholar
  5. 5.
    Richard J. Lipton. Using DNA to solve NP-complete problems. Science, 268:542–545, April 1995.Google Scholar
  6. 6.
    F.J. Martín-Mateos, J.A. Alonso, M.J. Pérez-Jiménez, and F. Sancho-Caparrini. Molecular computation models in ACL2: a simulation of Lipton’s experiment solving SAT. In Third International Workshop on the ACL2 Theorem Prover and Its Applications, Grenoble, 2002.Google Scholar
  7. 7.
    Sam Owre and Natarajan Shankar. The formal semantics of PVS. Technical Report SRI-CSL-97-2, Computer Science Laboratory, SRI International, Menlo Park,CA, August 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • C. Graciani Díaz
    • 1
  • F. J. Martín Mateos
    • 1
  • Mario J. Pérez Jiménez
    • 1
  1. 1.Dpto. de Ciencias de la Computación e Inteligencia ArtificialUniversidad de SevillaSpain

Personalised recommendations