Using automated reasoning systems on molecular computing

Authors:
Carmen Graciani Díaz;Mario J. Pérez-Jiménez
Affiliations:
Research Group on Natural Computing, Dpto. Ciencias de la Computación e Inteligencia Artificial, Universidad de Sevilla, Spain;Research Group on Natural Computing, Dpto. Ciencias de la Computación e Inteligencia Artificial, Universidad de Sevilla, Spain
Venue:
DNA'04 Proceedings of the 10th international conference on DNA computing
Year:
2004

Citing 3
Cited 0

Molecular computation of solutions to combinatorial problems

Science
An axiomatic basis for computer programming

Communications of the ACM
The Correctness Problem in Computer Science

The Correctness Problem in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.