{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:29Z","timestamp":1725663509613},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540556022"},{"type":"electronic","value":"9783540472520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55602-8_221","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:22:48Z","timestamp":1330251768000},"page":"766-770","source":"Crossref","is-referenced-by-count":4,"title":["The FAUST \u2014 prover"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Schneider","sequence":"first","affiliation":[]},{"given":"Ramayya","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Kropf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"71_CR1","volume-title":"Logic for Computer Science\u2014Foundations of Automated Theorem Proving","author":"J.H. Gallier","year":"1986","unstructured":"Gallier J.H., Logic for Computer Science\u2014Foundations of Automated Theorem Proving, Harper & Row Publishers, New York, 1986"},{"key":"71_CR2","doi-asserted-by":"crossref","unstructured":"M.J.C. Gordon, HOL: A Proof Generating System for Higher-Order Logic, in VLSI Specification, Verification and Synthesis, G. Birtwistle, P.A. Subrahrnanyam (eds.), Kluwer Academic Press, 1988","DOI":"10.1007\/978-1-4613-2007-4_3"},{"key":"71_CR3","doi-asserted-by":"crossref","unstructured":"Gentzen G., Untersuchungen \u00fcber das logische Schlie\u03b2en, Mathematische Zeitschrift, Vol. 39, 1935","DOI":"10.1007\/BF01201353"},{"key":"71_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02432151","volume":"2","author":"F.J. Pelletier","year":"1986","unstructured":"F.J. Pelletier, Seventy-Five Problems for Testing Automatic Theorem Provers, Journal of Automated Reasoning, Vol. 2, pp 191\u2013216, 1986","journal-title":"Journal of Automated Reasoning"},{"key":"71_CR5","unstructured":"S. Reeves, Semantic tableaux as a framework for automated theorem-proving, Departement of Computer Science and Statistics, Queen Mary College, Univ. of London, 1987"},{"key":"71_CR6","unstructured":"Schneider K., Ein Sequenzenkalk\u00fcl f\u00fcr die Hardware-Verifikation in HOL, Diploma Thesis, Institute of Computer Design and Fault-Tolerance, University of Karsruhe, 1991"},{"key":"71_CR7","doi-asserted-by":"crossref","unstructured":"Schneider K., Kumar R., Kropf T., Automating most parts of hardware proofs in HOL, Proc. Workshop on Computer Aided Verification, Aalborg, July 1991","DOI":"10.1007\/3-540-55179-4_35"},{"key":"71_CR8","volume-title":"Proc. VLSI 1991","author":"K. Schneider","year":"1991","unstructured":"Schneider K., Kumar R., Kropf T., Structuring Hardware Proofs: First Steps towards Automation in a Higher-Order Environment, Proc. VLSI 1991, Edinburgh, P.B. Denyer, A. Halaas (Eds.), North-Holland, 1991"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction\u2014CADE-11"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55602-8_221.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:00:29Z","timestamp":1605646829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55602-8_221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540556022","9783540472520"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-55602-8_221","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}