Buscar
Mostrando ítems 1-8 de 8
Tesis Doctoral
Verificación de programas en modelos de computación no convencionales
(2002)
El objetivo fundamental de esta memoria consiste en desarrollar una primer aproximación a la verificación formal de procedimientos mecánicos en modelos no convencionales, en el marco de la Computación Natural. Para ello, ...
Ponencia
Molecular Computation Models in ACL2: a Simulation of Lipton’s Experiment Solving SAT
(2002)
In this paper we present an ACL2 formalization of a molecular computing model: Adleman’s restricted model [2]. This is a first step to formalize unconventional models of computation in ACL2. As an application of this ...
Artículo
Verifying a P system generating squares
(Romanian Academy, Section for Information Science and Technology, 2002)
In [1], an example of a P system generating exactly all the squares of natural numbers greater than 1 is given. Nevertheless, only an informal reasoning of this result is presented. In this paper we study a similar P ...
Ponencia
Capítulo de Libro
Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment
(Springer, 2002)
The aim ofthis paper is to develop an executable prototype ofan unconventional model ofcomputation. Using the PVS verification system (an interactive environment for writing formal specifications and checking formal ...
Capítulo de Libro
Generation of Diophantine Sets by Computing P Systems with External Output
(Springer, 2002)
In this paper a variant of P systems with external output designed to compute functions on natural numbers is presented. These P systems are stable under composition and iteration of functions. We prove that every ...
Artículo
A Formalization of Transition P Systems
(IOS Press, 2002)
In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: transition P systems as they were given in [3], addressed ...
Capítulo de Libro
Solving Knapsack Problems in a Sticker Based Model
(Springer, 2002)
Our main goal in this paper is to give molecular solutions for two NP–complete problems, namely Subset-sum and Knapsack, in a sticker based model for DNA computations. In order to achieve this, we have used a finite set ...