{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:06Z","timestamp":1720624926278},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4472,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s1571-0661(04)80892-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"15-33","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Can American Checkers be Solved by Means of Symbolic Model Checking?"],"prefix":"10.1016","volume":"43","author":[{"given":"Michael","family":"Baldamus","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Wenz","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Ziller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB1","unstructured":"American Checkers Federation, Official Website (May 2000), http:\/\/www.acfcheckers.com."},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB2","unstructured":"Beatty D., R. Bryant, and C.-J. Seger, Synchronous Circuit Verification by Symbolic Simulation: an Illustration, in: W. Dally, editor, Advanced Research in VLSI (1990), pp. 98\u2013112, conference proceedings."},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB3","unstructured":"Becker B. and K. Drechsler, How Many Decomposition Types Do We Need?, in: Design and Test (1995), pp. 438\u2013443, proceedings EDTC '95."},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Berthet C., O. Coudert and J. Madre, New Ideas on Symbolic Manipulation of Finite State Machines, in: Computer Aided Design, 1990, proceedings ICCAD '90.","DOI":"10.1109\/ICCD.1990.130210"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph\u2013Based Algorithms for Boolean Function Manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Burch J., E. Clarke and D. Long, Representing Circuits More Efficiently in Symbolic Model Checking, in: Design Automation, 1991, pp. 403\u2013407, proceedings DAC '91.","DOI":"10.1145\/127601.127702"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB7","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 Transactions on Computer\ue4f8Aided Design of Integrated Cicuits and Systems"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB8","unstructured":"Burch J., E. Clarke, K. McMillan and D. Dill, Sequential Cicuit Verification Using Symbolic Model Checking, in: Design Automation (1990), pp. 46\u201351, proceedings DAC '90."},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB9","unstructured":"Burch J., E. Clarke, K. McMillan, D. Dill and L. Hwang, Symbolic Model Checking: 1020 States and Beyond, in: Logic in Computer Science (1990), pp. 1\u201333, proceedings LICS '90 symposium."},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB10","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","article-title":"Symbolic Model Checking: 1020 States and Beyond","volume":"98","author":"Burch","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01383878","article-title":"A Linear\u2013Time Model Checking Algorithm for Alternation\ue4f8Free \u03bc\ue4f8Calculus","volume":"2","author":"Cleaveland","year":"1993","journal-title":"Formal Methods in System Design"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Cook S., The Complexity of Theorem Proving Procedures, in: Theory of Computing, 1971, ACM symposium proceedings.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB13","doi-asserted-by":"crossref","unstructured":"Drechsler R., B. Becker and A. Jahnke, On Variable Ordering and Decomposition Type Choice in OKFDDs, in: W. Grass and M. Mutz, editors, Anwendung formaler Methoden beim Entwurf von Hardwaresystemen (1995), pp. 98\u2013107, GI\/ITG workshop proceedings.","DOI":"10.1109\/ASPDAC.1995.486406"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB14","unstructured":"Emerson E., and C.-L. Lei, Temporal Reasoning under Generalised Fairness Constraints, in: B. Monien and G. Vidal\ue4f8Naquet, editors, Theoretical Aspects of Computer Science (1986), pp. 21\u201336, proceedings TACAS '86 conference."},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB15","unstructured":"Gasser R., \u201cEfficiently Harnessing Computational Resources for Exhaustive Search,\u201d Ph.D. thesis, computer science department, Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich (1994)."},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB16","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the Propositional \u03bc\ue4f8Calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB17","doi-asserted-by":"crossref","unstructured":"Sanghavi J., R. Ranjan, R. Brayton and A. Sangiovanni\ue4f8Vincentelli, High\ue4f8Performance BDD Package by Exploiting Memory Hierarchy, in: Design Automation, 1996, pp. 635\u2013640, proceedings DAC '96.","DOI":"10.1109\/DAC.1996.545652"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB18","first-page":"21","article-title":"Chinook: The Man\u2013Machine World Checkers Champion","volume":"17","author":"Schaeffer","year":"1996","journal-title":"AI Magazine"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB19","doi-asserted-by":"crossref","unstructured":"Sentovich E., A Brief Study of BDD Package Performance, in: M. Srivas and A. Camilleri, editors, Formal Methods in Computer Aided Design, LNCS 1166 (1996), pp. 389\u2013403, proceedings FMCAD '96 conference.","DOI":"10.1007\/BFb0031823"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB20","doi-asserted-by":"crossref","unstructured":"Shilov N. and K. Yi, Puzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Learning Model Checkers, in: H. Bowman, editor, Formal Methods Elsewhere, Electronic Notes in Theoretical Computer Science (2001), proceedings FM\ue4f8Elsewhere 2001 workshop.","DOI":"10.1016\/S1571-0661(04)80893-4"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A Lattice\ue4f8Theoretical Fixpoint Theorem and its Applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/S1571-0661(04)80892-2_NEWBIB22","unstructured":"University of Alberta, Department of Computer Science, Chinook Website (May 2000), http:\/\/www.cs.ualberta.ca\/~chinook."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808922?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808922?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:56:11Z","timestamp":1549191371000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104808922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":22,"alternative-id":["S1571066104808922"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80892-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}