{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:07:28Z","timestamp":1742378848299},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551799"},{"type":"electronic","value":"9783540467632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55179-4_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:50:57Z","timestamp":1330249857000},"page":"225-232","source":"Crossref","is-referenced-by-count":8,"title":["Functional extension of symbolic model checking"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Filkorn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"issue":"12","key":"22_CR1","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1109\/TC.1986.1676711","volume":"C-35","author":"R. E. Bryant","year":"1986","unstructured":"R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions Computer, C-35(12):1035\u20131044, 1986.","journal-title":"IEEE Transactions Computer"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"J.R. Burch, E.M. Clarke, and D.E. Long. Representing circuits more efficiently in symbolic model checking. In ACM\/IEEE Design Automation Conference, 1991.","DOI":"10.1145\/127601.127702"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"J.R. Burch, E.M. Clarke, K.L. McMillan, and David L. Dill. Sequential circuit verification using symbolic model checking. In ACM\/IEEE Design Automation Conference, 1990.","DOI":"10.1145\/123186.123223"},{"key":"22_CR4","unstructured":"J.R. Burch, E.M. Clarke, K.L. McMillan, David L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In LICS, 1990."},{"key":"22_CR5","unstructured":"Olivier Coudert, Christian Berthet, and Jean-Christophe Madre. Verification of sequential machines using boolean functional vectors. In IMEC-IFIP International Workshop on Applied Formal Methods For Correct VLSI Design, 1989."},{"key":"22_CR6","unstructured":"Thomas Filkorn. Unifikation in endlichen Algebren und ihre Integration in Prolog. Master's thesis, Technical University Munich, 1988."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Jean-Christophe Madre, Olivier Coudert, Michel Currat, Alain Debreil, and Christian Berthet. The formal verification chain at BULL. In EURO ASIC 90, 1990.","DOI":"10.1109\/EASIC.1990.207991"},{"key":"22_CR8","unstructured":"Diederik Verkest, Luc Claesen, and Hugo De Man. Special benchmark session on formal system design. In IMEC-IFIP International Workshop on Applied Formal Methods For Correct VLSI Design, 1989."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55179-4_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:28:15Z","timestamp":1619573295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55179-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551799","9783540467632"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-55179-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}