{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:57:37Z","timestamp":1742399857559},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5860,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1016\/s0167-6423(96)00030-5","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T03:33:51Z","timestamp":1052796831000},"page":"79-98","source":"Crossref","is-referenced-by-count":5,"title":["Symbolic techniques for formally verifying industrial systems"],"prefix":"10.1016","volume":"29","author":[{"given":"S\u00e9rgio","family":"Campos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmund M.","family":"Clarke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius","family":"Minea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/S0167-6423(96)00030-5_BIB1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Transactions on Computers."},{"key":"10.1016\/S0167-6423(96)00030-5_BIB2","series-title":"Proc. 27th ACM\/IEEE Design Automation Conference","first-page":"46","article-title":"Sequential circuit verification using symbolic model checking","author":"Burch","year":"1990"},{"key":"10.1016\/S0167-6423(96)00030-5_BIB3","series-title":"Proc. 5th Annual IEEE Symposium on Logic in Computer Science","first-page":"403","article-title":"Symbolic model checking: 1020 states and beyond","author":"Burch","year":"1990"},{"key":"10.1016\/S0167-6423(96)00030-5_BIB4","article-title":"The priority inversion problem and real-time symbolic model checking","author":"Campos","year":"1993"},{"issue":"2","key":"10.1016\/S0167-6423(96)00030-5_BIB5","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","article-title":"Automatic verification of finite-state concurrent systems using temporal logic specifications","volume":"8","author":"Clarke","year":"1986","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0167-6423(96)00030-5_BIB6","series-title":"Internat. Symp. on Computer Hardware Description Languages and their Applications","article-title":"Verification of the Futurebus + cache coherence protocol","author":"Clarke","year":"1993"},{"key":"10.1016\/S0167-6423(96)00030-5_BIB7","first-page":"136","article-title":"Quantitative temporal reasoning","volume":"Vol. 531","author":"Emerson","year":"1990"},{"key":"10.1016\/S0167-6423(96)00030-5_BIB8","first-page":"1","article-title":"IEEE Standard for Futurebus+-Logical Protocol Specification","author":"IEEE Computer Society","year":"1992"},{"key":"10.1016\/S0167-6423(96)00030-5_BIB9","series-title":"82378 System I\/O (SIO) \u2014 PCI Local Bus","author":"Intel Corporation","year":"1993"},{"key":"10.1016\/S0167-6423(96)00030-5_BIB10","series-title":"PCI Local Bus Specification","author":"Intel Corporation","year":"1993"},{"key":"10.1016\/S0167-6423(96)00030-5_BIB11","series-title":"Symbolic Model Checking","author":"McMillan","year":"1993"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642396000305?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642396000305?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T03:55:22Z","timestamp":1555473322000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642396000305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0167642396000305"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(96)00030-5","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}