{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:39Z","timestamp":1725663819868},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578260"},{"type":"electronic","value":"9783540483465"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57826-9_150","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:26:58Z","timestamp":1330244818000},"page":"385-398","source":"Crossref","is-referenced-by-count":2,"title":["Eliminating higher-order quantifiers to obtain decision procedures for hardware verification"],"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,5,31]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF01448035","volume":"110","author":"W. Ackermann","year":"1935","unstructured":"W. Ackermann. Untersuchungen \u00fcber das Eliminationsproblem der mathematischen Logik. Mathematische Annalen, 110:390\u2013413, 1935.","journal-title":"Mathematische Annalen"},{"key":"30_CR2","unstructured":"P.B. Andrews. A Transfinite Type Theory with Type Variables. North-Holland Publishing Company, 1965."},{"key":"30_CR3","volume-title":"Technical Report MPI-I-92-231","author":"D. Gabbay","year":"1992","unstructured":"D. Gabbay and H. J. Ohlbach. Quantifier elimination in second-order predicate logic. Technical Report MPI-I-92-231, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, July 1992."},{"key":"30_CR4","unstructured":"M.J.C. Gordon. Why higher-order logic is a good formalism for specifying and verifying hardware. In G. Milne and P.A. Subrahmanyam, editors, Formal aspects of VLSI Design. North-Holland, 1986."},{"key":"30_CR5","unstructured":"M.J.C. Gordon. Programming Language Theory and its Implementation. International Series in Computer Science. Prentice Hall, 1988."},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00121125","volume":"1","author":"A. Gupta","year":"1992","unstructured":"A. Gupta. Formal hardware verification methods: A survey. Journal of Formal Methods in System Design, 1:151\u2013238, 1992.","journal-title":"Journal of Formal Methods in System Design"},{"issue":"3","key":"30_CR7","first-page":"242","volume":"133","author":"F.K. Hanna","year":"1986","unstructured":"F.K. Hanna and N. Daeche. Specification and verification of digital systems using higher-order predicate logic. IEE Proc. Pt. E, 133(3):242\u2013254, 1986.","journal-title":"IEE Proc. Pt. E"},{"key":"30_CR8","unstructured":"S.L.P. Jones. The Implementation of Functional Programming Languages. Prentice Hall, 1987."},{"key":"30_CR9","unstructured":"J. Joyce. More reasons why higher-order logic is a good formalism for specifying and verifying hardware. In International Workshop on Formal Methods in VLSI Design, Miami, 1991."},{"issue":"2","key":"30_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01383880","volume":"2","author":"R. Kumar","year":"1993","unstructured":"R. Kumar, K. Schneider, and Th. Kropf. Structuring and automating hardware proofs in a higher-order theorem-proving environment. Journal of Formal Methods in System Design, 2(2):165\u2013223, 1993.","journal-title":"Journal of Formal Methods in System Design"},{"key":"30_CR11","first-page":"81","volume-title":"Structuring hardware proofs: First steps towards automation in a higher-order environment","author":"K. Schneider","year":"1991","unstructured":"K. Schneider, R. Kumar, and Th. Kropf. Structuring hardware proofs: First steps towards automation in a higher-order environment. In P.B. Denyer A. Halaas, editor, International Conference on Very Large Scale Integration, pages 81\u201390, Edinburg, Edingburgh, 1991. North Holland."},{"key":"30_CR12","series-title":"volume A-20 of IFIP Transactions","first-page":"165","volume-title":"Higher Order Logic Theorem Proving and its Applications","author":"K. Schneider","year":"1992","unstructured":"K. Schneider, R. Kumar, and Th. Kropf. Modelling generic hardware structures by abstract datatypes. In L.J.M. Claesen and M.J.C. Gordon, editors, Higher Order Logic Theorem Proving and its Applications, volume A-20 of IFIP Transactions, pages 165\u2013176, Leuven, Belgium, 1992. North-Holland."},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"K. Schneider, R. Kumar, and Th. Kropf. Alternative proof procedures for finite-state machines in a higher-order environment. In International Workshop on Higher-Order Logic Theorem Proving and its Applications, Vancouver, Canada, 1993.","DOI":"10.1007\/3-540-57826-9_137"}],"container-title":["Lecture Notes in Computer Science","Higher Order Logic Theorem Proving and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57826-9_150.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:14:31Z","timestamp":1605629671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57826-9_150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578260","9783540483465"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57826-9_150","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}