{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:18Z","timestamp":1776333498773,"version":"3.51.2"},"reference-count":18,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3862,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003]]},"DOI":"10.1016\/s1571-0661(05)82542-3","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"543-560","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":203,"title":["Temporal Induction by Incremental SAT Solving"],"prefix":"10.1016","volume":"89","author":[{"given":"Niklas","family":"E\u00e9n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niklas","family":"S\u00f6rensson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82542-3_BIB1","doi-asserted-by":"crossref","unstructured":"J. Baumgartner, A. Kuehlmann, J. Abraham \u201cProperty Checking via Structural Analysis\u201d in CAV 2002, LNCS:2404, Springer-Verlag.","DOI":"10.1007\/3-540-45657-0_12"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB2","series-title":"FMCAD 2000","article-title":"\u201cSAT-based Verification without State Space Traversal\u201d","author":"Bjesse","year":"1954"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB3","series-title":"TACAS 1999","article-title":"\u201cSymbolic model checking without BDDs\u201d","author":"Biere","year":"1579"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB4","doi-asserted-by":"crossref","unstructured":"A. Biere, E.M. Clarke, R. Raimi, and Y. Zhu. \u201cVerifying safety properties of a PowerPC[tm] microprocessor using symbolic model checking without BDDs\u201d in CAV 1999, LNCS:1633.","DOI":"10.21236\/ADA360973"},{"issue":"8","key":"10.1016\/S1571-0661(05)82542-3_BIB5","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1986.1676819","article-title":"\u201cGraph-based algorithms for boolean function manipulation\u201d","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans, on Computers"},{"issue":"7","key":"10.1016\/S1571-0661(05)82542-3_BIB6","article-title":"\u201cModel Checking Large Software Specifications\u201d","volume":"24","author":"Chan","year":"1998","journal-title":"IEEE Tran. on Software Engineering"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB7","doi-asserted-by":"crossref","unstructured":"F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, M.Y. Vardi. \u201cBenefits of bounded model checking at an industrial setting\u201d in CAV 2001, LNCS:2102.","DOI":"10.1007\/3-540-44585-4_43"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB8","author":"Claessen"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB9","doi-asserted-by":"crossref","DOI":"10.1145\/368273.368557","article-title":"\u201cA machine program for theorem proving","volume":"vol 5","author":"Davis","year":"1962","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB10","unstructured":"C.A.J. van Eijk. \u201cSequential equivalence checking without state space traversal\u201d in Proc. Conf. on Design, Automation and Test in Europe, 1998."},{"key":"10.1016\/S1571-0661(05)82542-3_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(93)90018-C","article-title":"\u201cSolving the Incremental Satisfiability Problem\u201d","volume":"vol 15","author":"Hooker","year":"1993","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB12","series-title":"VMCAI 2003","article-title":"\u201cEfficient Computation of Recurrence Diameters\u201d","author":"Kroening","year":"2003"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB13","doi-asserted-by":"crossref","DOI":"10.1109\/12.769433","article-title":"\u201cGRASP: A Search Algorithm for Propositional Satisfiability\u201d","volume":"vol 48","author":"Marques-Silva","year":"1999","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB14","doi-asserted-by":"crossref","unstructured":"M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik \u201cChaff: Engineering an Efficient SAT Solver\u201d in DAC 2001.","DOI":"10.1145\/378239.379017"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB15","series-title":"CAV 2000","article-title":"\u201cTuning SAT checkers for Bounded Model Checking\u201d","author":"Strichman","year":"1855"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB16","doi-asserted-by":"crossref","unstructured":"O. Strichman. \u201cPruning techniques for the SAT-based Bounded Model Checking Problem\u201d in Proc. 11th Advanced Research Working Conf. on Correct Hardware Design and Verification Methods, 2001.","DOI":"10.1007\/3-540-44798-9_4"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB17","doi-asserted-by":"crossref","unstructured":"M. Sheeran, S. Singh, G. St\u00e5lmarck. \u201cChecking safety properties using induction and a SAT-solver\u201d in FMCAD 2000, LNCS:1954.","DOI":"10.1007\/3-540-40922-X_8"},{"key":"10.1016\/S1571-0661(05)82542-3_BIB18","doi-asserted-by":"crossref","unstructured":"J. Whittemore, J. Kim, K. Sakallah. \u201cSATIRE: A New Incremental Satisfiability Engine\u201d in DAC 2001, ACM Press.","DOI":"10.1145\/378239.379019"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825423?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825423?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:05Z","timestamp":1761610145000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003]]}},"alternative-id":["S1571066105825423"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82542-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Temporal Induction by Incremental SAT Solving","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)82542-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}