{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:14:35Z","timestamp":1761610475334,"version":"build-2065373602"},"reference-count":13,"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)82547-2","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"623-638","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["A BMC-Formulation for the Scheduling Problem in Highly Constrained Hardware Systems"],"prefix":"10.1016","volume":"89","author":[{"given":"Gianpiero","family":"Cabodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Nocco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Quer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Kondratiev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Lavagno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yosinori","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1997","series-title":"\u201cHardware-Software Co-design of Embedded Systems \u2013 The POLIS Approach,\u201d","author":"Balarin","key":"10.1016\/S1571-0661(05)82547-2_BIB1"},{"year":"2000","series-title":"\u201cAutomata-Based Symbolic Scheduling,\u201d","author":"Haynal","key":"10.1016\/S1571-0661(05)82547-2_BIB2"},{"key":"10.1016\/S1571-0661(05)82547-2_BIB3","series-title":"Proc. IEEE ICCAD\u203298","first-page":"477","article-title":"\u201cEfficient Encoding for Exact Symbolic Automata-Based Scheduling,\u201d","author":"Haynal","year":"1998"},{"key":"10.1016\/S1571-0661(05)82547-2_BIB4","article-title":"\u201cAutomata-Based Scheduling for Looping DFGs\u201d","author":"Haynal","year":"1999","journal-title":"Internal Report EC99_14"},{"key":"10.1016\/S1571-0661(05)82547-2_BIB5","unstructured":"http:\/\/ftp.ics.uci.edu\/pub\/hlsynth\/HLSynth92, http:\/\/ftp.ics.uci.edu\/pub\/hlsynth\/HLSynth95."},{"key":"10.1016\/S1571-0661(05)82547-2_BIB6","unstructured":"http:\/\/www.synopsys.com\/products\/logic\/design_compiler.html."},{"key":"10.1016\/S1571-0661(05)82547-2_BIB7","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/43.75629","article-title":"\u201cA Formal Approach to the Scheduling Problem in High-Level Synthesis,\u201d","volume":"10","author":"Hwang","year":"1991","journal-title":"IEEE Trans, on Computer-Aided Design"},{"issue":"12","key":"10.1016\/S1571-0661(05)82547-2_BIB8","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1109\/43.811321","article-title":"\u201cHigh-level synthesis of low-power control-flow intensive circuits,\u201d","volume":"18","author":"Khouri","year":"1999","journal-title":"IEEE Trans, on Computer-Aided Design"},{"key":"10.1016\/S1571-0661(05)82547-2_BIB9","doi-asserted-by":"crossref","unstructured":"A. C. Parker, J. T. Pizzarro, and M. Mlinar, \u201cMAHA: A Program for Datapath Synthesis,\u201d Proc. IEEE\/ACM ICCAD\u203291, pages 461\u2013466, Las Vegas, June 1986","DOI":"10.1109\/DAC.1986.1586129"},{"key":"10.1016\/S1571-0661(05)82547-2_BIB10","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1109\/43.31522","article-title":"\u201cForce-Directed Scheduling for the Behavioral Synthesis of ASICs,\u201d","volume":"8","author":"Paulin","year":"1989","journal-title":"IEEE Trans, on Computer-Aided Design"},{"issue":"1","key":"10.1016\/S1571-0661(05)82547-2_BIB11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/43.486271","article-title":"\u201cA New Symbolic Technique for Control-Dependent Scheduling,\u201d","volume":"C-15","author":"Radivojevic","year":"1996","journal-title":"IEEE Trans, on Computer-Aided Design"},{"key":"10.1016\/S1571-0661(05)82547-2_BIB12","doi-asserted-by":"crossref","unstructured":"E. Goldberg and Y. Novikov, \u201cBerkMin: a Fast and Robust SAT-Solver,\u201d Proc. IEEE\/ACM DATE\u203202, pages 142\u2013149 Paris, Feb. 2002","DOI":"10.1109\/DATE.2002.998262"},{"key":"10.1016\/S1571-0661(05)82547-2_BIB13","doi-asserted-by":"crossref","unstructured":"G. Cabodi and S. Nocco and S. Quer, \u201cImproving SAT-based Bounded Model Checking by Means of BDD-based Approximate Traversals,\u201d Proc. IEEE\/ACM DATE 2003, pages 898\u2013903, Munich, Germany, March 2003","DOI":"10.1109\/DATE.2003.1253720"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825472?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825472?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:03Z","timestamp":1761610143000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003]]}},"alternative-id":["S1571066105825472"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82547-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A BMC-Formulation for the Scheduling Problem in Highly Constrained Hardware Systems","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)82547-2","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"}]}}