Chapter of Book
Using Automated Reasoning Systems on Molecular Computing
Author/s | Graciani Díaz, Carmen
![]() ![]() ![]() ![]() ![]() ![]() ![]() Pérez Jiménez, Mario de Jesús ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Department | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Publication Date | 2005 |
Deposit Date | 2017-01-25 |
Published in |
|
ISBN/ISSN | 978-3-540-26174-2 0302-9743 |
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 ... 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. |
Citation | Graciani Díaz, C., y Pérez Jiménez, M.d.J. (2005). Using Automated Reasoning Systems on Molecular Computing. En DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384 (pp. 128-137). Berlin: Springer. |
Files | Size | Format | View | Description |
---|---|---|---|---|
chp%3A10.1007%2F11493785_11.pdf | 200.0Kb | ![]() | View/ | |