{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:55Z","timestamp":1725488575223},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443117"},{"type":"electronic","value":"9783540458333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45833-6_11","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T06:25:53Z","timestamp":1186813553000},"page":"126-136","source":"Crossref","is-referenced-by-count":1,"title":["Specification of Adleman\u2019s Restricted Model Using an Automated Reasoning System: Verification of Lipton\u2019s Experiment"],"prefix":"10.1007","author":[{"given":"C. Graciani","family":"D\u00edaz","sequence":"first","affiliation":[]},{"given":"F. J. Mart\u00edn","family":"Mateos","sequence":"additional","affiliation":[]},{"given":"Mario J.","family":"P\u00e9rez Jim\u00e9nez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Leonard M. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021\u20131024, November 11, 1994.","DOI":"10.1126\/science.7973651"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Leonard M. Adleman. On constructing a molecular computer. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996. DNA Based Computers.","DOI":"10.1090\/dimacs\/027\/01"},{"key":"11_CR3","unstructured":"Judy Crow, Sam Owre, John Rushby, Natarajan Shankar, and Mandayam Srivas. A tutorial introduction to PVS. Presented at WIFT\u2019 95: Workshop on Industrial-Strength Formal Specification Techniques, Boca Raton, Florida, April 1995. Available, with specification files, at http:\/\/www.csl.sri.com\/papers\/wift-tutorial\/ ."},{"key":"11_CR4","unstructured":"M.J. P\u00e9rez Jim\u00e9nez, F. Sancho Caparrini, M.C. Graciani D\u00edaz, and A. Romero Jim\u00e9nez. Soluciones moleculares del problema SAT de la L\u00f3gica Proposicional. In L\u00f3gica, Lenguaje e Informaci\u00f3n, JOLL\u20192000, pages 243\u2013252. Ed. Kronos, 2000."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Richard J. Lipton. Using DNA to solve NP-complete problems. Science, 268:542\u2013545, April 1995.","DOI":"10.1126\/science.7725098"},{"key":"11_CR6","unstructured":"F.J. Mart\u00edn-Mateos, J.A. Alonso, M.J. P\u00e9rez-Jim\u00e9nez, and F. Sancho-Caparrini. Molecular computation models in ACL2: a simulation of Lipton\u2019s experiment solving SAT. In Third International Workshop on the ACL2 Theorem Prover and Its Applications, Grenoble, 2002."},{"key":"11_CR7","volume-title":"Technical Report SRI-CSL-97-2","author":"S. Owre","year":"1997","unstructured":"Sam Owre and Natarajan Shankar. The formal semantics of PVS. Technical Report SRI-CSL-97-2, Computer Science Laboratory, SRI International, Menlo Park,CA, August 1997."}],"container-title":["Lecture Notes in Computer Science","Unconventional Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45833-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:06:54Z","timestamp":1556737614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45833-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443117","9783540458333"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45833-6_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}