Advertisement

Using Automated Reasoning Systems on Molecular Computing

  • Carmen Graciani Díaz
  • Mario J. Pérez-Jiménez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3384)

Abstract

This paper is focused on the interplay between automated reasoning systems (as theoretical and formal devices to study the correctness of a program) and DNA computing (as practical devices to handle DNA strands to solve classical hard problems with laboratory techniques). To illustrate this work we have proven in the PVS proof checker, the correctness of a program, in a sticker based model for DNA computation, solving the pairwise disjoint families problem. Also we introduce the formalization of the Floyd–Hoare logic for imperative programs.

Keywords

Proof Tree Memory Complex Sticker Model Hoare Logic Consequence Rule 
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.
    Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)CrossRefGoogle Scholar
  2. 2.
    Boyer, R.S., Moore, J.S.: The correctness problem in computer science. Academic Press, London (1981)zbMATHGoogle Scholar
  3. 3.
    Gloess, P.Y.: Imperative program verification in PVS (1999), http://www.labri.fr/Perso/~gloess/imperative/
  4. 4.
    Díaz, C.G.: Especificación y verificación de programas moleculares en PVS. Doctoral Thesis, University of Seville (2003)Google Scholar
  5. 5.
    Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM 12(10), 576–583 (1969)zbMATHCrossRefGoogle Scholar
  6. 6.
    Kari, L., Paun, G., Rozenberg, G., Salomaa, A., Yu, S.: DNA computing, sticker systems and universality. Acta Informatica 35, 401–420 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Owre, S., Shankar, N., Rushby, J.: The PVS specification and verification system, pvs.csl.sri.com
  8. 8.
    Owre, S., Shankar, N.: The formal semantics of PVS. Technical Report SRI-CSL-97-2, Computer Science Laboratory, SRI International, Menlo Park, CA (August 1997)Google Scholar
  9. 9.
    Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N.V., Goodman, M.F., Rothemund, P.W.K., Adleman, L.M.: A sticker based model for DNA computation. In: Landweber, L., Baum, E. (eds.) DNA Based Computers II. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol. 44, pp. 1–27. American Mathematical Society (1999)Google Scholar
  10. 10.
    Sancho, F.: Verificación de programas en modelos de computación no convencionales. Doctoral Thesis, University of Seville (2002)Google Scholar
  11. 11.
    Pfeifer, H., Dold, A., Henke, F.W.v., Rueß., H.: Mechanized Semantics of Simple Imperative Programming Constructs. Ulmer Informatik-Berichte 96-11, Universität Ulm, Fakultät für Informatik (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Carmen Graciani Díaz
    • 1
  • Mario J. Pérez-Jiménez
    • 1
  1. 1.Research Group on Natural Computing, Dpto. Ciencias de la Computación e Inteligencia ArtificialUniversidad de SevillaSpain

Personalised recommendations