{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:17:02Z","timestamp":1755217022204,"version":"3.43.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Formal Methods in System Design"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1023\/a:1008632417306","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"267-289","source":"Crossref","is-referenced-by-count":3,"title":["The General Product Machine: a New Model for Symbolic FSM Traversal"],"prefix":"10.1007","volume":"12","author":[{"given":"Giampiero","family":"Cabodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Camurati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fulvio","family":"Corno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Prinetto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo Sonza","family":"Reorda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"160594_CR1","doi-asserted-by":"crossref","unstructured":"K.S. Brace, R.L. Rudell and R.E. Bryant, \u201cEfficient Implementation of a BDD Package,\u201d 27th ACM\/IEEE Design Automation Conference, Orlando, Florida, pp. 40\u201345, June 1990.","DOI":"10.1145\/123186.123222"},{"key":"160594_CR2","doi-asserted-by":"crossref","unstructured":"F. Brglez, D. Bryan and K. Ko\u017ami\u0144ski, \u201cCombinatorial Profiles of Sequential Benchmark Circuits,\u201d IEEE Int'l Symposium on Circuits and Systems, Portland, Oregon, pp. 1929\u20131934, May 1989.","DOI":"10.1109\/ISCAS.1989.100747"},{"key":"160594_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant, \u201cGraph-based Algorithms for Boolean Function Manipulation,\u201d IEEE Transactions on Computers, Vol. C-35, pp. 677\u2013691, August 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"160594_CR4","doi-asserted-by":"crossref","unstructured":"J.R. Burch, E.M. Clarke and D.E. Long, \u201cRepresenting Circuits More Efficiently in Symbolic Model Checking,\u201d 28th ACM\/IEEE Design Automation Conference, San Francisco, California, pp. 403\u2013407, June 1991.","DOI":"10.1145\/127601.127702"},{"key":"160594_CR5","doi-asserted-by":"crossref","unstructured":"J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill and L.J. Hwang, \u201cSymbolic Model Checking: 1020 States and Beyond,\u201d 5th Annual IEEE Symposium on Logic in Computer Science, pp. 428\u2013439, June 1990.","DOI":"10.1109\/LICS.1990.113767"},{"key":"160594_CR6","doi-asserted-by":"crossref","unstructured":"G. Cabodi and P. Camurati, \u201cExploiting cofactoring for efficient FSM symbolic traversal based on the Transition Relation,\u201d IEEE Int'l Conference on Computer Design, Cambridge, Massachusetts, pp. 299\u2013303, October 1993.","DOI":"10.1109\/ICCD.1993.393362"},{"key":"160594_CR7","doi-asserted-by":"crossref","unstructured":"G. Cabodi, P. Camurati, F. Corno, S. Gai, P. Prinetto and M. Sonza Reorda, \u201cA new model for improving symbolic Product Machine traversal,\u201d 29thACM\/IEEE Design Automation Conference, Anaheim, California, pp. 614\u2013619, June 1992.","DOI":"10.1109\/DAC.1992.227812"},{"key":"160594_CR8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00971936","volume":"4","author":"G. Cabodi","year":"1993","unstructured":"G. Cabodi, P. Camurati, F. Corno, P. Prinetto and M. Sonza Reorda, \u201cAn Approach to Sequential Circuit Diagnosis based on Formal Verification Techniques\u201d Journal of Electronic Testing: Theory and Applications, Vol. 4, pp. 11\u201317, February 1993.","journal-title":"Journal of Electronic Testing: Theory and Applications"},{"key":"160594_CR9","unstructured":"G. Cabodi, P. Camurati and S. Quer, \u201cDetecting hard faults with combined approximate forward \/ backward symbolic techniques,\u201d IEEE Int'l Symposium on Circuits and Systems, London, UK, May 1994."},{"key":"160594_CR10","doi-asserted-by":"crossref","unstructured":"H. Cho, G.D. Hachtel, E. Macii, B. Plessier and F. Somenzi, \u201cAlgorithms for approximate FSM traversals,\u201d 30th ACM\/IEEE Design Automation Conference, Dallas, Texas, pp. 25\u201330, June 1993.","DOI":"10.1145\/157485.164555"},{"key":"160594_CR11","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1109\/43.238030","volume":"12","author":"H. Cho","year":"1993","unstructured":"H. Cho, G.D. Hachtel and F. Somenzi, \u201cRedundancy identification\/removal and test generation for sequential circuits using implicit state enumeration,\u201d IEEE Transactions on CAD, Vol. 12, pp. 935\u2013945, July 1993.","journal-title":"IEEE Transactions on CAD"},{"key":"160594_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF00971937","volume":"4","author":"H. Cho","year":"1993","unstructured":"H. Cho, S.-W. Jeong, F. Somenzi and C. Pixley, \u201cSynchronization Sequences and Symbolic Traversal Techniques in Test Generation\u201d Journal of Electronic Testing: Theory and Applications, Vol. 4, pp. 19\u201331, February 1993.","journal-title":"Journal of Electronic Testing: Theory and Applications"},{"key":"160594_CR13","doi-asserted-by":"crossref","unstructured":"H. Cho, G. Hachtel, S.W. Jeong, B. Plessier, E. Schwarz and F. Somenzi, \u201cATPG Aspects of FSM Verification,\u201d IEEE Int'l Conference on Computer Aided Design, Santa Clara, California, pp. 134\u2013137, November 1990.","DOI":"10.1109\/ICCAD.1990.129861"},{"key":"160594_CR14","doi-asserted-by":"crossref","unstructured":"H. Cho, G. Hachtel, S.W. Jeong, B. Plessier, E. Schwarz and F. Somenzi, \u201cResults on the Interface Between Formal Verification and ATPG,\u201d in E.M. Clarke and R. Kurshan, Eds., DIMACS Series in Discrete Mathematics Science, Volume 3, pp. 615\u2013628, 1991.","DOI":"10.1090\/dimacs\/003\/38"},{"key":"160594_CR15","series-title":"LNCS","first-page":"365","volume-title":"Automatic verification methods for finite state systems","author":"O. Coudert","year":"1989","unstructured":"O. Coudert, C. Berthet and J.C. Madre, \u201cVerification of sequential machines based on symbolic execution,\u201d in Automatic verification methods for finite state systems, volume 407 of LNCS, Springer-Verlag, Berlin, Germany, pp. 365\u2013373, 1989."},{"key":"160594_CR16","first-page":"111","volume-title":"IFIP Int'l Workshop on Applied Formal Methods for Correct VLSI Design","author":"O. Coudert","year":"1989","unstructured":"O. Coudert, C. Berthet and J.C. Madre, \u201cVerification of Sequential Machines Using Boolean Function Vectors,\u201d IFIP Int'l Workshop on Applied Formal Methods for Correct VLSI Design, Vol. 1, Leuven, Belgium, pp. 111\u2013128, November 1989."},{"key":"160594_CR17","doi-asserted-by":"crossref","unstructured":"O. Coudert and J.C. Madre, \u201cA Unified Framework for the Formal Verification of Sequential Circuits,\u201d IEEE Int'l Conf. on Computer Aided Design, Santa Clara, California, pp. 126\u2013129, November 1990.","DOI":"10.1109\/ICCAD.1990.129859"},{"key":"160594_CR18","unstructured":"O. Coudert and J.C. Madre, \u201cSymbolic Computation of the Valid States of the Sequential Machine: Algorithms and Discussion,\u201d Int'l Workshop on Formal Methods in VLSI Design, Miami, Florida, January 1991."},{"key":"160594_CR19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/TC.1981.1675757","volume":"C-30","author":"P. Goel","year":"1981","unstructured":"P. Goel, \u201cAn Implicit Enumeration Algorithm to Generate Tests for Combinatorial Logic Circuits,\u201d IEEE Transactions on Computers, Vol. C-30, pp. 215\u2013222, 1981.","journal-title":"IEEE Transactions on Computers"},{"key":"160594_CR20","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/43.67786","volume":"10","author":"S.H. Hwang","year":"1991","unstructured":"S.H. Hwang and A.R. Newton, \u201cAn Efficient Verifier for Finite State Machines,\u201d IEEE Transactions on CAD, Vol. 10, pp. 326\u2013334, March 1991.","journal-title":"IEEE Transactions on CAD"},{"key":"160594_CR21","series-title":"Computer Science Series","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1978","unstructured":"Z. Kohavi, Switching and Finite Automata Theory, second edition, Computer Science Series, McGraw Hill, New York, 1978.","edition":"second edition"},{"key":"160594_CR22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01759032","volume":"6","author":"C. Leiserson","year":"1991","unstructured":"C. Leiserson and J. Saxe, \u201cRetiming Synchronous Circuitry,\u201d Algorithmica, Vol. 6, pp. 5\u201335, 1991.","journal-title":"Algorithmica"},{"key":"160594_CR23","doi-asserted-by":"crossref","unstructured":"H. Touati, H. Savoj, B. Lin, R.K. Brayton and A. Sangiovanni-Vincentelli, \u201cImplicit Enumeration of Finite State Machines Using BDDs,\u201d IEEE Int'l Conference on Computer Aided Design, Santa Clara, California, pp. 130\u2013133, November 1990.","DOI":"10.1109\/ICCAD.1990.129860"},{"key":"160594_CR24","doi-asserted-by":"crossref","unstructured":"W. Wolf, \u201cThe FSM network model for behavioral synthesis of control-dominated machines,\u201d 27th IEEE\/ACM Design Automation Conference, Orlando, Florida, pp. 692\u2013697, June 1990.","DOI":"10.1145\/123186.123442"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008632417306.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008632417306\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008632417306.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T04:07:25Z","timestamp":1754366845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008632417306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["160594"],"URL":"https:\/\/doi.org\/10.1023\/a:1008632417306","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}