{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:36:39Z","timestamp":1761708999096},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/isvdat.2014.6881061","type":"proceedings-article","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T16:38:16Z","timestamp":1408725496000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Extending the scope of translation validation by augmenting path based equivalence checkers with SMT solvers"],"prefix":"10.1109","author":[{"given":"Kunal","family":"Banerjee","sequence":"first","affiliation":[]},{"given":"Chittaranjan","family":"Mandal","sequence":"additional","affiliation":[]},{"given":"Dipankar","family":"Sarkar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"0","key":"19"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1145\/115372.115320"},{"key":"17","first-page":"317","article-title":"An incremental and layered procedure for the satisfiability of linear arithmetic logic","author":"bozzano","year":"2005","journal-title":"TACAS"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1109\/ICVD.2003.1183177"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/32.58767"},{"year":"0","key":"24"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1109\/EURDAC.1995.527434"},{"key":"16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","article-title":"Assigning meaning to programs","author":"floyd","year":"1967","journal-title":"Proceedings the 19th Symposium on Applied Mathematics"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1109\/ISED.2012.28"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1109\/43.62794"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1145\/2209291.2209303"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1109\/TCAD.2009.2035542"},{"year":"0","key":"21"},{"key":"3","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/309847.309935","article-title":"A reordering technique for efficient code motion","author":"santos","year":"1999","journal-title":"DAC"},{"year":"0","key":"20"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/TCAD.2003.822105"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/ICVD.2000.812610"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/ASPDAC.2011.5722241"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/ISQED.2006.10"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1145\/1366110.1366134"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/ISQED.2004.1283659"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/43.833200"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/TCAD.2007.913390"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/TCAD.2010.2042889"}],"event":{"name":"2014 18th International Symposium on VLSI Design and Test (VDAT)","start":{"date-parts":[[2014,7,16]]},"location":"Coimbatore, India","end":{"date-parts":[[2014,7,18]]}},"container-title":["18th International Symposium on VLSI Design and Test"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/6873898\/6881034\/06881061.pdf?arnumber=6881061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T05:47:35Z","timestamp":1689486455000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/6881061\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":24,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/isvdat.2014.6881061","relation":{},"subject":[],"published":{"date-parts":[[2014,7]]}}}