{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:56:23Z","timestamp":1763808983031,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540237389"},{"type":"electronic","value":"9783540304944"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30494-4_28","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T18:42:14Z","timestamp":1277836934000},"page":"399-413","source":"Crossref","is-referenced-by-count":11,"title":["A Partitioning Methodology for BDD-Based Verification"],"prefix":"10.1007","author":[{"given":"Debashis","family":"Sahoo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subramanian","family":"Iyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jawahar","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Stangier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Narayan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David L.","family":"Dill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. Allen","family":"Emerson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Bollig, B., Wegener, I.: Partitioned BDDs vs. other BDD models. In: IWLS (1997)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers\u00a0C-35, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Burch, J.R., Clarke, E.M., Long, D.E.: Symbolic Model Checking with Partitioned Transition Relations. In: Proc. of the Design Automation Conf., pp. 403\u2013407 (1991)","DOI":"10.1145\/127601.127702"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Cabodi, G., Camurati, P., Quer, S.: Improved reachability analysis of large finite state machines. In: ICCAD, pp. 354\u2013360 (1996)","DOI":"10.1109\/ICCAD.1996.569819"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","first-page":"52","volume-title":"Proc. IBM Workshop on Logics of Programs","author":"E.M. Clarke","year":"1981","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1981)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Coudert, O., Berthet, C., Madre, J.C.: Verification of sequential machines based on symbolic execution. In: Proc. of the Workshop on Automatic Verification Methods for Finite State Systems (1989)","DOI":"10.1007\/3-540-52148-8_30"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Grumberg, O., Heyman, T., Schuster, A.: Distributed symbolic model checking for \u03bc-calculus. In: Computer Aided Verification, pp. 350\u2013362 (2001)","DOI":"10.1007\/3-540-44585-4_32"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-39724-3_35","volume-title":"Correct Hardware Design and Verification Methods","author":"S. Iyer","year":"2003","unstructured":"Iyer, S., Sahoo, D., Stangier, C., Narayan, A., Jain, J.: Improved symbolic Verification Using Partitioning Techniques. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol.\u00a02860, pp. 410\u2013424. Springer, Heidelberg (2003)"},{"key":"28_CR9","unstructured":"Jain, J., Bitner, J., Fussell, D.S., Abraham, J.A.: Functional partitioning for verification and related problems. In: VLSI Conference. Brown\/MIT (1992)"},{"key":"28_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Narayan, A., Isles, A., Jain, J., Brayton, R., Sangiovanni-Vincentelli, A.: Reachability Analysis Using Partitioned-ROBDDs. In: ICCAD, pp. 388\u2013393 (1997)","DOI":"10.1109\/ICCAD.1997.643565"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Narayan, A., Jain, J., Fujita, M., Sangiovanni-Vincentelli, A.: Partitioned-ROBDDs - A Compact, Canonical and Efficiently Manipulable Representation for Boolean Functions. In: ICCAD, pp. 547\u2013554 (1996)","DOI":"10.1109\/ICCAD.1996.569909"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Pixley, C.: Introduction to a computational theory and implementation of sequential hardware equivalence (1990)","DOI":"10.1090\/dimacs\/003\/20"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Ravi, K., Somenzi, F.: High-density reachability analysis. In: ICCAD, pp. 154\u2013158 (1995)","DOI":"10.1109\/ICCAD.1995.480006"},{"key":"28_CR15","unstructured":"Fabio Somenzi. CUDD: CU Decision Diagram Package (2001), ftp:\/\/vlsi.colorado.edu\/pub"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Touati, H.J., Savoj, H., Lin, B., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: Implicit State Enumeration of Finite State Machines using BDD\u2019s. In: ICCAD, pp. 130\u2013133 (1990)","DOI":"10.1109\/ICCAD.1990.129860"},{"key":"28_CR17","unstructured":"VIS. Vis verilog benchmarks (2001), http:\/\/vlsi.colorado.edu\/~vis\/"}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30494-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T09:57:13Z","timestamp":1740218233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30494-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540237389","9783540304944"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30494-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}