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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Díaz, C. G., & Pérez-Jiménez, M. J. (2005). Using automated reasoning systems on molecular computing. In Lecture Notes in Computer Science (Vol. 3384, pp. 128–137). Springer Verlag. https://doi.org/10.1007/11493785_11
Mendeley helps you to discover research relevant for your work.