{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:38:51Z","timestamp":1729665531758,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/socc.2015.7406959","type":"proceedings-article","created":{"date-parts":[[2016,3,27]],"date-time":"2016-03-27T22:08:48Z","timestamp":1459116528000},"page":"257-262","source":"Crossref","is-referenced-by-count":6,"title":["Synthesis and verification of cyclic combinational circuits"],"prefix":"10.1109","author":[{"given":"Jui-Hung","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yung-Chih","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wan-Chen","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching-Yi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Yao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","first-page":"115","article-title":"On the complexity of derivation in propositional calculus","author":"tseitin","year":"1968","journal-title":"Studies in Constr Math and Math Logic"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1109\/PROC.1964.3416","article-title":"mathematical techniques in electronics and engineering analysis","volume":"52","author":"craig","year":"1964","journal-title":"Proceedings of the IEEE"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2003.1218925"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-40922-X_22"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263531"},{"key":"ref14","first-page":"530","article-title":"Finding the longest simple path in cyclic combinational circuits","author":"hsu","year":"1998","journal-title":"Proc ICCAD"},{"journal-title":"Benchmarks","year":"2005","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382610"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1109\/T-C.1970.222884","article-title":"the necessity of closed circuit loops in minimal combinational circuits","volume":"c 19","author":"kautz","year":"1970","journal-title":"IEEE Transactions on Computers"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/43.310903"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/43.293952"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/EDTC.1996.494321"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2348839.2348848"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FTCS.1988.5293"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654209"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687545"},{"key":"ref29","first-page":"345","article-title":"False loops through resource sharing","author":"stok","year":"1992","journal-title":"Proc ICCAD"},{"year":"0","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837399"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2058510"},{"key":"ref2","first-page":"24","article-title":"The synthesis of cyclic dependencies with Craig interpolation","author":"backes","year":"2009","journal-title":"Proc IWLS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2167327"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2008.4681565"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44585-4_12"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICVD.1995.512086"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2003305"},{"key":"ref24","first-page":"105","article-title":"Cyclic combinational circuits: Analysis for synthesis","author":"riedel","year":"2003","journal-title":"Proc IWLS"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2003.1218927"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1977.1674886"},{"key":"ref25","first-page":"69","article-title":"Timing analysis of cyclic combinational circuits","author":"riedel","year":"2004","journal-title":"Proc IWLS"}],"event":{"name":"2015 28th IEEE International System-on-Chip Conference (SOCC)","start":{"date-parts":[[2015,9,8]]},"location":"Beijing, China","end":{"date-parts":[[2015,9,11]]}},"container-title":["2015 28th IEEE International System-on-Chip Conference (SOCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7363404\/7406870\/07406959.pdf?arnumber=7406959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T05:23:09Z","timestamp":1498281789000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7406959\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/socc.2015.7406959","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}