{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:18:14Z","timestamp":1771978694251,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2212142"],"award-info":[{"award-number":["CCF-2212142"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,23]]},"DOI":"10.1145\/3649329.3656533","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["RexBDDs: Reduction-on-Edge Complement-and-Swap Binary Decision Diagrams"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4906-6145","authenticated-orcid":false,"given":"Gianfranco","family":"Ciardo","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7737-6888","authenticated-orcid":false,"given":"Andrew","family":"Miner","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2388-0222","authenticated-orcid":false,"given":"Lichuan","family":"Deng","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7917-6571","authenticated-orcid":false,"given":"Junaid","family":"Babar","sequence":"additional","affiliation":[{"name":"Collins Aerospacce, Cedar Rapids, IA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. 8th Int. Symp. on Fault-Tolerant Computing. 75--82","author":"Akers S. B.","year":"1978","unstructured":"S. B. Akers. 1978. Functional testing using binary decision diagrams. In Proc. 8th Int. Symp. on Fault-Tolerant Computing. 75--82."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-021-00640-0"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17465-1_17"},{"key":"e_1_3_2_1_4_1","first-page":"8","article-title":"Graph-based algorithms for boolean function manipulation","volume":"35","author":"Bryant Randy E.","year":"1986","unstructured":"Randy E. Bryant. 1986. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp. 35, 8 (Aug. 1986), 677--691.","journal-title":"IEEE Trans. Comp."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc","author":"Bryant Randal E.","unstructured":"Randal E. Bryant. 2018. Chain Reduction for Binary and Zero-Suppressed Decision Diagrams. In Proc. TACAS. Springer, 81--98."},{"key":"e_1_3_2_1_7_1","volume-title":"Clarke","author":"Kimura Shinji","year":"1990","unstructured":"Shinji Kimura and Edmund M. Clarke. 1990. A parallel algorithm for constructing binary decision diagrams. In Proc. ICCD. IEEE CS Press, 220--223."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc","author":"Madre Jean-Christophe","unstructured":"Jean-Christophe Madre and Jean-Paul Billon. 1988. Proving circuit correctness using formal comparison between expected and extracted behaviour. In Proc. ACM\/IEEE DAC (Atlantic City, New Jersey, USA). IEEE CS Press, 205--210."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM.1997.620354"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090100038"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. ACM\/IEEE DAC. IEEE CS Press, 52--57","author":"Minato S.","unstructured":"S. Minato, N. Ishiura, and S. Yajima. 1990. Shared binary decision diagram with attributed edges for efficient boolean function manipulation. In Proc. ACM\/IEEE DAC. IEEE CS Press, 52--57."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.23919\/FMCAD.2017.8102248"}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656533","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3656533","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3656533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:55Z","timestamp":1750295875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":11,"alternative-id":["10.1145\/3649329.3656533","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3656533","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}