{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T12:10:07Z","timestamp":1682770207555},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":4258,"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,12]]},"DOI":"10.1016\/s1571-0661(04)80666-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"23-33","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Symbolic Model Checking using Overlapping Projections"],"prefix":"10.1016","volume":"23","author":[{"given":"Shankar G.","family":"Govindaraju","sequence":"first","affiliation":[]},{"given":"David L.","family":"Dill","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB1","first-page":"165","article-title":"\"The Existence of Refinement Mappings\"","author":"m.","year":"1988","journal-title":"LICS"},{"issue":"No. 8","key":"10.1016\/S1571-0661(04)80666-2_NEWBIB2","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"\"Graph-Based Algorithms for Boolean Function Manipulation\"","volume":"Vol. C-35","author":"R.E.","year":"1986","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB3","first-page":"428","article-title":"\u201cSymbolic Model Checking: 1020 States and Beyond\u201d","author":"J.R.","year":"1990","journal-title":"LICS"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB4","first-page":"22","article-title":"Symbolic Exploration of Large Circuits with Enhanced Forward\/Backward Traversals","author":"Cabodi","year":"1994","journal-title":"EURO-DAC 1994"},{"issue":"No. 12","key":"10.1016\/S1571-0661(04)80666-2_NEWBIB5","first-page":"1465","article-title":"Algorithms for Approximate FSM Traversal Based on State Space Decomposition","volume":"Vol. 15","author":"H.","year":"1996","journal-title":"IEEE TCAD"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB6","first-page":"126","article-title":"\"A Unified Frameword for the Formal Verification of Sequential Circuits\"","author":"Coudert","year":"1990","journal-title":"ICCAD"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB7","series-title":"POPL","first-page":"238","article-title":"Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints","author":"Cousot","year":"1977"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB8","first-page":"409","article-title":"Verification of Real-Time Systems by Successive Over and Under Approximation","author":"D.L.","year":"1995","journal-title":"CAV"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB9","first-page":"225","article-title":"Functional Extension of Symbolic Model Checking","author":"Filkorn","year":"1991","journal-title":"CAV"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB10","first-page":"451","article-title":"Ajpproximate Reachability with BDDs Using Overlapping Projections","author":"Govindaraju","year":"1998","journal-title":"DAC"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB11","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/288548.289055","article-title":"Verification by Approximate Foward and Backward Reachability","author":"Govindaraju","year":"1998","journal-title":"ICCAD"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB12","doi-asserted-by":"crossref","DOI":"10.1145\/309847.309940","article-title":"Improved Approximate Reachability using Auxiliary State Variables","author":"Goindaraju","year":"1999","journal-title":"DAC"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB13","first-page":"301","article-title":"The Stanford FLASH Multiprocessor","author":"Kuskin","year":"1994","journal-title":"ISCA"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB14","first-page":"76","article-title":"Tearing Based Automatic Abstraction for CTL Model Checking","author":"Lee","year":"1996","journal-title":"ICCAD"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB15","first-page":"13","article-title":"A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking","author":"McMIllan","year":"1996","journal-title":"CAV"},{"key":"10.1016\/S1571-0661(04)80666-2_NEWBIB16","first-page":"154","article-title":"High-density Reachability Analysis","author":"Ravi","year":"1995","journal-title":"ICCAD"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806662?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806662?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T11:39:59Z","timestamp":1682768399000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S1571066104806662"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80666-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}