{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T14:23:07Z","timestamp":1773843787539,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,5,20]]},"DOI":"10.1109\/ets61313.2024.10567242","type":"proceedings-article","created":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T17:54:49Z","timestamp":1719424489000},"page":"1-6","source":"Crossref","is-referenced-by-count":5,"title":["Polynomial Formal Verification of Approximate Adders with Constant Cutwidth"],"prefix":"10.1109","author":[{"given":"Mohamed","family":"Nadeem","sequence":"first","affiliation":[{"name":"University of Bremen,Bremen,Germany"}]},{"given":"Chandan Kumar","family":"Jha","sequence":"additional","affiliation":[{"name":"University of Bremen,Bremen,Germany"}]},{"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[{"name":"University of Bremen,Bremen,Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/b105236"},{"key":"ref2","volume-title":"Formal System Verification: State-of the-Art and Future Trends","author":"Drechsler","year":"2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s100090100056"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3083682"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2200\/s00457ed1v01y201211aim019"},{"key":"ref7","article-title":"Answer set programming: Towards efficient and scalable knowledge representation and reasoning","volume-title":"Proceedings of the 1st Intl. ASP\u201901 Workshop","author":"Provetti"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref9","first-page":"70:1","article-title":"Polynomial formal verification: Ensuring correctness under resource constraints","author":"Drechsler","year":"2022","journal-title":"ICCAD"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS52668.2021.9417052"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586107"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ATS52891.2021.00027"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0606026"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3625223.3649274"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.2975695"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2019.2910137"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2023.3268275"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2958605"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/DSD57027.2022.00107"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342133"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/DTIS.2016.7483885"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JXCDC.2022.3222015"},{"key":"ref23","first-page":"10","article-title":"Evoapproxlib: Extended library of approximate arithmetic circuits","volume-title":"Proc. Workshop Open-Source EDA Technol.(WOSET)","author":"Mrazek"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2217962"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2011.6105401"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/12.53597"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"ref30","article-title":"Logic programs with stable model semantics as a constraint programming paradigm","year":"1999","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20895-9_39"},{"key":"ref34","article-title":"The AIGER And-Inverter Graph (AIG) format version 20071012","author":"Biere","year":"2007","journal-title":"Institute for Formal Models and Verification, Johannes Kepler University, Tech. Rep"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS54261.2022.9770152"}],"event":{"name":"2024 IEEE European Test Symposium (ETS)","location":"The Hague, Netherlands","start":{"date-parts":[[2024,5,20]]},"end":{"date-parts":[[2024,5,24]]}},"container-title":["2024 IEEE European Test Symposium (ETS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10567048\/10567052\/10567242.pdf?arnumber=10567242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T04:36:37Z","timestamp":1719549397000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10567242\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,20]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/ets61313.2024.10567242","relation":{},"subject":[],"published":{"date-parts":[[2024,5,20]]}}}