乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T21:19:17Z","timestamp":1720214357198},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0304-3975(01)00345-0","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"161-179","source":"Crossref","is-referenced-by-count":14,"title":["On the non-termination of MDG-based abstract state enumeration"],"prefix":"10.1016","volume":"300","author":[{"given":"Otmane A\u0131\u0308t","family":"Mohamed","sequence":"first","affiliation":[]},{"given":"Xiaoyu","family":"Song","sequence":"additional","affiliation":[]},{"given":"Eduard","family":"Cerny","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00345-0_BIB1","unstructured":"S. Bose, A.L. Fisher, Automatic verification of synchronous circuits using symbolic logic simulation and temporal logic, in: Proc. IMEC\u2013IFIP Workshop on Applied Formal Methods for Correct VLSI Design, 1989."},{"issue":"8","key":"10.1016\/S0304-3975(01)00345-0_BIB2","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for boolean function manipulation","volume":"35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(01)00345-0_BIB3","doi-asserted-by":"crossref","unstructured":"R.E. Bryant, D.L. Beatty, C.-J.H. Seger, Formal hardware verification by symbolic ternary trajectory evaluation, In 28th ACM\/IEEE Design Automation Conf., 1991.","DOI":"10.1145\/127601.127701"},{"issue":"4","key":"10.1016\/S0304-3975(01)00345-0_BIB4","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/43.275352","article-title":"Symbolic model checking for sequential circuit verification","volume":"13","author":"Burch","year":"1994","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"10.1016\/S0304-3975(01)00345-0_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1006\/inco.1995.1140","article-title":"Recurrence domains: their unification and application to logic programming","volume":"122","author":"Chen","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(01)00345-0_BIB6","series-title":"Proc. 2nd Internat. Workshop on Conditional and Typed Rewriting Systems, Montreal (Canada)","first-page":"100","article-title":"On finite representations of infinite sequences of terms","volume":"Vol. 516","author":"Chen","year":"1990"},{"key":"10.1016\/S0304-3975(01)00345-0_BIB7","doi-asserted-by":"crossref","unstructured":"H. Cho, G. Hachtel, S.-W. Jeong, B. Plessier, E. Schwarz, F. Somenzi, ATPG aspects of FSM verification, in: Internat. Conf. on Computer-Aided Design, 1990.","DOI":"10.1109\/ICCAD.1990.129861"},{"key":"10.1016\/S0304-3975(01)00345-0_BIB8","unstructured":"L. Claesen, F. Proesmans, E. Verlind, H. De Man, SFG-tracing: a methodology for the automatic verification of MOS transistor level implementations from high level behavioral specifications, in: P.A. Subrahmanyam (Ed.), Internat. Workshop on Formal Methods in VLSI Design, Miami, FL, January 1991."},{"key":"10.1016\/S0304-3975(01)00345-0_BIB9","doi-asserted-by":"crossref","unstructured":"H. Comon, Completion of rewrite systems with membership constraints, in: W. Kuich (Ed.), Proc. 19th ICALP Conf., Wien (Austria), Lecture Notes in Computer Science, Vol. 623, Springer, Berlin, July 1992, pp. 392\u2013403; exists also as Research report 699, LRI, Orsay.","DOI":"10.1007\/3-540-55719-9_91"},{"issue":"1","key":"10.1016\/S0304-3975(01)00345-0_BIB10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1008663530211","article-title":"Multiway decision graphs for automated hardware verification","volume":"10","author":"Corella","year":"1997","journal-title":"Formal Methods System Design"},{"key":"10.1016\/S0304-3975(01)00345-0_BIB11","doi-asserted-by":"crossref","unstructured":"O. Coudert, J.C. Madre, A unified framework for the formal verification of sequential circuits, in: Internat. Conf. on Computer-Aided Design, 1990.","DOI":"10.1109\/ICCAD.1990.129859"},{"key":"10.1016\/S0304-3975(01)00345-0_BIB12","unstructured":"B. Gramlich, Unification of term schemes \u2014 theory and applications, SEKI Report SR-88-18, Universit\u00e4t Kaiserslautern, Germany, 1988."},{"key":"10.1016\/S0304-3975(01)00345-0_BIB13","series-title":"Proc. 3rd Conf. on Algebraic and Logic Programming, Volterra (Italy)","first-page":"115","article-title":"On the relation between primitive recursion, schematization, and divergence","volume":"Vol. 632","author":"Hermann","year":"1992"},{"issue":"2\u20133","key":"10.1016\/S0304-3975(01)00345-0_BIB14","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(89)90007-8","article-title":"Schematization of infinite sets of rewrite rules generated by divergent completion process","volume":"67","author":"Kirchner","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00345-0_BIB15","series-title":"Proc. 3rd Internat. Conf. on Logic Programming and Automated Reasoning, St. Petersburg (Russia)","first-page":"409","article-title":"The unification of infinite sets of terms and its applications","volume":"Vol. 624","author":"Salzer","year":"1992"},{"key":"10.1016\/S0304-3975(01)00345-0_BIB16","doi-asserted-by":"crossref","unstructured":"H.J. Touati, H. Savoj, B. Lin, R.K. Brayton, A. Sangiovanni-Vincentelli, Implicit state enumeration of finite state machines using BDDs, in: Internat. Conf. on Computer-Aided Design, 1990.","DOI":"10.1109\/ICCAD.1990.129860"},{"key":"10.1016\/S0304-3975(01)00345-0_BIB17","doi-asserted-by":"crossref","unstructured":"Z. Zhou, X. Song, S. Tahar, F. Corella, E. Cerny, M. Langevin, Formal verification of the island tunnel controller using multiway decision graphs, in: Proc. Internat. Conf. on Formal Methods in Computer Aided Design (FMCAD\u201996), Palo Alto, California, USA, November 1996.","DOI":"10.1007\/BFb0031811"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003450?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003450?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T15:56:48Z","timestamp":1553443008000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0304397501003450"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00345-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}