{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:21:55Z","timestamp":1725664915776},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602750"},{"type":"electronic","value":"9783540447849"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60275-5_63","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:05:36Z","timestamp":1330279536000},"page":"154-169","source":"Crossref","is-referenced-by-count":5,"title":["An automata theory dedicated towards formal circuit synthesis"],"prefix":"10.1007","author":[{"given":"Dirk","family":"Eisenbiegler","sequence":"first","affiliation":[]},{"given":"Ramayya","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"11_CR1","first-page":"247","volume-title":"Higher Order Logic Theorem Proving and Its Applications","author":"N. Day","year":"1992","unstructured":"Nancy Day. A comparison between statecharts and state transition assertions. In [hug92], pages 247\u2013262."},{"key":"11_CR2","first-page":"101","volume-title":"Higher Order Logic Theorem Proving and Its Applications","author":"D. Eisenbiegler","year":"1993","unstructured":"D. Eisenbiegler, K. Schneider, and R. Kumar. A functional approach for formalizing regular hardware structures. In [hug93], pages 101\u2013114."},{"volume-title":"Higher Order Logic Theorem Proving and Its Applications","year":"1992","key":"11_CR3","unstructured":"Luc Claesen and Michael Gordon, editors. Higher Order Logic Theorem Proving and Its Applications, Leuven, Belgium, November 1992. North-Holland."},{"volume-title":"Higher Order Logic Theorem Proving and Its Applications","year":"1993","key":"11_CR4","unstructured":"Jeffrey J. Joyce and Carl-Johan H. Seger, editors. Higher Order Logic Theorem Proving and Its Applications, Vancouver, B.C., Canada, August 1993. Springer."},{"key":"11_CR5","first-page":"227","volume-title":"Higher Order Logic Theorem Proving and Its Applications","author":"P. Loewenstein","year":"1992","unstructured":"Paul Loewenstein. A formal theory of simulations between infinite automata. In [hug92], pages 227\u2013246."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"F. Melham. Automating recursive type definitions in higher order logic. Technical Report 140, University of Cambridge Computer Laboratory, 1988.","DOI":"10.1007\/978-1-4612-3658-0_9"},{"key":"11_CR7","first-page":"213","volume-title":"Higher Order Logic Theorem Proving and Its Applications","author":"R. Kumar","year":"1993","unstructured":"R. Kumar K. Schneider and Thomas Kropf. Alternative proof procedures for finite-state machines in higher-order logic. In [hug93], pages 213\u2013226."}],"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-60275-5_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:57:18Z","timestamp":1605646638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60275-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602750","9783540447849"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-60275-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}