Abstract
Theorem proving is a classical AI problem with a broad range of applications. Since its complexity is exponential in the size of the problem, many methods to parallelize the process has been proposed. One of these approaches is based on the massive parallelism of molecular reactions. ACL2 is an automated theorem prover especially adequate for algorithm verification. In this paper we present an ACL2 formalization of a molecular computational model: Adleman’s restricted model. As an application of this model, an implementation of Lipton’s experiment solving SAT is described. We use ACL2 to make a formal proof of the completeness and soundness properties of this implementation.
This work has been supported by project TIC2000-1368-C03-02 (Ministry of Science and Technology, Spain), cofinanced by FEDER funds.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Adleman, L.M.: On constructing a molecular computer. In: DNA Based Computers. DIMACS Series, vol. 27, pp. 1–21. American Mathematical Society, Providence (1996)
Braich, R.S., Chelyapov, N., Johnson, C., Rothemund, P.W.K., Adleman, L.: Solution of a 20-Variable 3-SAT Problem on a DNA Computer. Science 296, 499–502 (2002)
Beaver, D.: A universal molecular computer. DNA Based Computers. DIMACS Series, vol. 27, pp. 29–36. American Mathematical Society, Providence (1996)
Graciani, C., Martín–Mateos, F.J., Pérez–Jiménez, M.J.: Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 126–136. Springer, Heidelberg (2002)
Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, Dordrecht (2000)
Kaufmann, M., Moore, J.S.: ACL2 Version 2.7, Homepage (2002), http://www.cs.utexas.edu/users/moore/acl2/
Kaufmann, M., Moore, J.S.: Structured Theory Development for a Mechanized Logic. Journal of Automated Reasoning 26(2), 161–203 (2001)
Moore, J.S.: Piton: a mechanically verified assembly-level language. Kluwer Academic Publisher, Dordrecht (1996)
Lee, I.-H., Park, J.-Y., Jang, H.-M., Chai, Y.-G., Zhang, B.-T.: DNA Implementation of Theorem Proving with Resolution Refutation in Propositional Logic. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 156–167. Springer, Heidelberg (2003)
Lipton, R.J.: DNA solution of hard computational problems. Science 268, 542–545 (1995)
Owre, S., Rushby, J.M., Shankar, N., Stringer–Calvert, D.W.J.: PVS System Guide. Homepage, http://pvs.csl.sri.com/
Paun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)
Pérez–Jiménez, M.J., Sancho, F., Graciani, C., Romero, A.: Soluciones moleculares del problema SAT (in spanish). Lógica, Lenguaje e Información. In: Kronos (ed.) JOLL 2000, pp. 243–252 (2000)
Russinoff, D.: A mechanically checked proof of IEEE compliance of the floating point multiplication, division and square root algorithms of the AMD-K7 processor. LMS J. of Comp. Math. 1, 148–200 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martín-Mateos, F.J., Alonso, J.A., Hidalgo, M.J., Ruiz-Reina, J.L. (2004). Formal Verification of Molecular Computational Models in ACL2: A Case Study. In: Conejo, R., Urretavizcaya, M., Pérez-de-la-Cruz, JL. (eds) Current Topics in Artificial Intelligence. TTIA 2003. Lecture Notes in Computer Science(), vol 3040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25945-9_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-25945-9_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22218-7
Online ISBN: 978-3-540-25945-9
eBook Packages: Springer Book Archive