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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Boyer, R.S., Moore, J.S.: The correctness problem in computer science. Academic Press, London (1981)
Gloess, P.Y.: Imperative program verification in PVS (1999), http://www.labri.fr/Perso/~gloess/imperative/
Díaz, C.G.: Especificación y verificación de programas moleculares en PVS. Doctoral Thesis, University of Seville (2003)
Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM 12(10), 576–583 (1969)
Kari, L., Paun, G., Rozenberg, G., Salomaa, A., Yu, S.: DNA computing, sticker systems and universality. Acta Informatica 35, 401–420 (1998)
Owre, S., Shankar, N., Rushby, J.: The PVS specification and verification system, pvs.csl.sri.com
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)
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)
Sancho, F.: Verificación de programas en modelos de computación no convencionales. Doctoral Thesis, University of Seville (2002)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Díaz, C.G., Pérez-Jiménez, M.J. (2005). Using Automated Reasoning Systems on Molecular Computing. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_11
Download citation
DOI: https://doi.org/10.1007/11493785_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)