{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:05:09Z","timestamp":1772906709809,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T00:00:00Z","timestamp":1718150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,12]]},"DOI":"10.1145\/3649476.3658766","type":"proceedings-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T12:29:41Z","timestamp":1718022581000},"page":"502-506","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Exploring the Potential of Decision Diagrams for Efficient In-Memory Design Verification"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-7408-8399","authenticated-orcid":false,"given":"Khushboo","family":"Qayyum","sequence":"first","affiliation":[{"name":"Computer Science, University of Bremen \/DFKI GmbH, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2300-267X","authenticated-orcid":false,"given":"Abhoy","family":"Kole","sequence":"additional","affiliation":[{"name":"DFKI GmbH, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1191-998X","authenticated-orcid":false,"given":"Kamalika","family":"Datta","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Bremen \/DFKI GmbH, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4217-3079","authenticated-orcid":false,"given":"Muhammad","family":"Hassan","sequence":"additional","affiliation":[{"name":"University of Bremen \/DFKI GmbH, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9872-1740","authenticated-orcid":false,"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[{"name":"University of Bremen \/DFKI GmbH, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"L. Amaru P-E Gaillardon and G.\u00a0D. Micheli. 2014. Majority Inverter Graph: A novel data-structure and algorithms for efficient logic optimization. DAC.","DOI":"10.1145\/2593069.2593158"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"B. Becker R. Drechsler and R. Enders. 1997. On the representational power of bit-level and word-level decision diagrams. ASP-DAC.","DOI":"10.1007\/978-3-663-01442-3_3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"K. Bhunia A. Deb K. Datta M. Hassan S. Shirinzadeh and R. Drechsler. 2023. ReSG: A Data Structure for Verification of Majority based In-Memory Computing on ReRAM Crossbars. TECS.","DOI":"10.1145\/3615358"},{"key":"e_1_3_2_1_4_1","article-title":"Graph-based algorithms for boolean function manipulation. Computers","author":"Bryant E.","year":"1986","unstructured":"R.\u00a0E. Bryant. 1986. Graph-based algorithms for boolean function manipulation. Computers, IEEE Transactions on.","journal-title":"IEEE Transactions on."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"R.\u00a0E. Bryant and Y. Chen. 2001. Verification of arithmetic circuits using binary moment diagrams. STTT.","DOI":"10.1007\/s100090100037"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"S. Chakraborti P.V. Chowdhary K. Datta and I. Sengupta. 2014. BDD based Synthesis of Boolean Functions using Memristors. IDT.","DOI":"10.1109\/IDT.2014.7038601"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"C. Chen K. Li A. Ouyang Z. Zeng and K. Li. 2018. GFlink: An in-memory computing architecture on heterogeneous CPU-GPU clusters for big data. TPDS.","DOI":"10.1109\/TPDS.2018.2794343"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"A. Deb K. Datta M. Hassan S. Shirinzadeh and R. Drechsler. 2023. Automated Equivalence Checking Method for Majority based In-Memory Computing on ReRAM Crossbars. ASP-DAC.","DOI":"10.1145\/3566097.3567842"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"R. Drechsler. 2021. PolyAdd: Polynomial Formal Verification of Adder Circuits. DDECS.","DOI":"10.1109\/DDECS52668.2021.9417052"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"R. Drechsler B. Becker and S. Ruppertz. 1997. The K*BMD: A verification data structure. IEEE Design & Test of Computers.","DOI":"10.1109\/54.587742"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"R. Drechsler and A. Mahzoon. 2022. Polynomial Formal Verification: Ensuring Correctness under Resource Constraints : (Invited Paper). ICCAD.","DOI":"10.1145\/3578448"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"S. Froehlich and R. Drechsler. 2022. Generation of Verified Programs for In-Memory Computing. DSD.","DOI":"10.1109\/DSD57027.2022.00114"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"R. Gharpinde P.\u00a0L. Thangkhiew K. Datta and I. Sengupta. 2018. A Scalable In-Memory Logic Synthesis Approach Using Memristor Crossbar. TVLSI.","DOI":"10.1109\/TVLSI.2017.2763171"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"S. H\u00f6reth and R. Drechsler. 1999. Formal verification of word-level specifications. DATE.","DOI":"10.1145\/307418.307447"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"J. Klhufek and V. Mrazek. 2022. ArithsGen: Arithmetic Circuit Generator for Hardware Accelerators. DDECS.","DOI":"10.1109\/DDECS54261.2022.9770152"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"S. Kvatinsky D. Belousov S. Liman G. Satat N. Wald E.\u00a0G. Friedman A. Kolodny and U.\u00a0C. Weiser. 2014. MAGIC\u2014Memristor-aided logic. TCAS-II.","DOI":"10.1109\/TCSII.2014.2357292"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"F. Lalchhandama M. Sahani V.\u00a0M. Srinivas I. Sengupta and K. Datta. 2022. In-Memory Computing on Resistive RAM Systems Using Majority Operation. JCSC.","DOI":"10.1142\/S0218126622500712"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"K. Qayyum A. Mahzoon and R. Drechsler. 2022. Monitoring the Effects of Static Variable Orders on the Construction of BDDs. MESIICON.","DOI":"10.1109\/MESIICON55227.2022.10093493"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"F. Shirinzadeh A. Deb S. Shirinzadeh A. Kole K. Datta and R. Drechsler. 2024. In-Memory SAT-Solver for Self-Verification of Programmable Memristive Architectures. VLSID.","DOI":"10.1109\/VLSID60093.2024.00070"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"S. Shirinzadeh M. Soeken P.-E. Gaillardon and R. Drechsler. 2016. Fast logic synthesis for RRAM-based in-memory computing using Majority-Inverter Graphs. DATE.","DOI":"10.3850\/9783981537079_0771"},{"key":"e_1_3_2_1_21_1","unstructured":"M. Soeken 2018. The EPFL logic synthesis libraries. arXiv preprint arXiv:1805.05121."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"P.\u00a0L. Thangkhiew R. Gharpinde and K. Datta. 2018. Efficient mapping of Boolean functions to memristor crossbar using MAGIC NOR gates. TCAS-I.","DOI":"10.1109\/TCSI.2018.2792474"},{"key":"e_1_3_2_1_23_1","volume-title":"SWORD: A SAT like prover using word level information. VLSI-SoC.","author":"Wille R.","year":"2009","unstructured":"R. Wille, G. Fey, D. Gro\u00dfe, S. Eggersgl\u00fc\u00df, and R. Drechsler. 2009. SWORD: A SAT like prover using word level information. VLSI-SoC."}],"event":{"name":"GLSVLSI '24: Great Lakes Symposium on VLSI 2024","location":"Clearwater FL USA","acronym":"GLSVLSI '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the Great Lakes Symposium on VLSI 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649476.3658766","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649476.3658766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T02:29:18Z","timestamp":1755829758000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649476.3658766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,12]]},"references-count":23,"alternative-id":["10.1145\/3649476.3658766","10.1145\/3649476"],"URL":"https:\/\/doi.org\/10.1145\/3649476.3658766","relation":{},"subject":[],"published":{"date-parts":[[2024,6,12]]},"assertion":[{"value":"2024-06-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}