{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:00:15Z","timestamp":1768280415615,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030995232","type":"print"},{"value":"9783030995249","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"vor","delay-in-days":88,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Motivated by applications in boolean-circuit design, boolean synthesis is the process of synthesizing a boolean function with multiple outputs, given a relation between its inputs and outputs. Previous work has attempted to solve boolean functional synthesis by converting a specification formula into a Binary Decision Diagram (BDD) and quantifying existentially the output variables. We make use of the fact that the specification is usually given in the form of a Conjunctive Normal Form (CNF) formula, and we can perform resolution on a symbolic representation of a CNF formula in the form of a Zero-suppressed Binary Decision Diagram (ZDD). We adapt the realizability test to the context of CNF and ZDD, and show that the<jats:italic>Cross<\/jats:italic>operation defined in earlier work can be used for witness construction. Experiments show that our approach is complementary to BDD-based Boolean synthesis.<\/jats:p>","DOI":"10.1007\/978-3-030-99524-9_4","type":"book-chapter","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:14:55Z","timestamp":1648534495000},"page":"64-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["ZDD Boolean Synthesis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8443-2246","authenticated-orcid":false,"given":"Yi","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9608-1404","authenticated-orcid":false,"given":"Lucas M.","family":"Tabajara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0661-5773","authenticated-orcid":false,"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,30]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Akshay, S., Chakraborty, S., Goel, S., Kulal, S., Shah, S.: What\u2019s hard about Boolean functional synthesis? In: Proc. 30th Int\u2019l Conf. on Computer Aided Verification, Part I. Lecture Notes in Computer Science, vol. 10981, pp. 251\u2013269. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_14","DOI":"10.1007\/978-3-319-96145-3_14"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bryant, R.: Graph-based algorithms for Boolean-function manipulation. IEEE Transactions on Computing C-35(8), 677\u2013691 (1986)","DOI":"10.1109\/TC.1986.1676819"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Chakraborty, S., Fried, D., Tabajara, L.M., Vardi, M.Y.: Functional synthesis via input-output separation. In: Proc. 2018 IEEE Conf. on Formal Methods in Computer Aided Design. pp. 1\u20139. IEEE (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8603000","DOI":"10.23919\/FMCAD.2018.8603000"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Chatalic, P., Simon, L.: Multi-resolution on compressed sets of clauses. In: Proc 12th IEEE Int\u2019l Conf. on Tools with Artificial Intelligence. pp. 2\u201310. IEEE Computer Society (2000). https:\/\/doi.org\/10.1109\/TAI.2000.889839","DOI":"10.1109\/TAI.2000.889839"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Chatalic, P., Simon, L.: ZRES: The old Davis-Putman procedure meets ZBDD. In: Proc. 17th Int\u2019l Conf. on Automated Deduction. Lecture Notes in Computer Science, vol. 1831, pp. 449\u2013454. Springer (2000)","DOI":"10.1007\/10721959_35"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Crama, Y., Hammer, P.L.: Boolean functions: Theory, algorithms, and applications. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511852008"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Dechter, R., van Beek, P.: Local and global relational consistency. Theor. Comput. Sci. 173(1), 283\u2013308 (1997)","DOI":"10.1016\/S0304-3975(97)86737-0"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Dudek, J.M., Phan, V.H.N., Vardi, M.Y.: Procount: Weighted projected model counting with graded project-join trees. In: Proc. 24th Int\u2019l Conf. on Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, vol. 12831, pp. 152\u2013170. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-80223-3_11","DOI":"10.1007\/978-3-030-80223-3_11"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Fried, D., Tabajara, L.M., Vardi, M.Y.: BDD-based Boolean functional synthesis. In: Proc. 28th Int\u2019l Conf. on Computer Aided Verification. Part II. Lecture Notes in Computer Science, vol. 9780, pp. 402\u2013421. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_22","DOI":"10.1007\/978-3-319-41540-6_22"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Golia, P., Roy, S., Meel, K.S.: Manthan: A data-driven approach for Boolean function synthesis. In: Proc. 32nd Int\u2019l Conf. on on Computer Aided Verification, Part II. Lecture Notes in Computer Science, vol. 12225, pp. 611\u2013633. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_31","DOI":"10.1007\/978-3-030-53291-8_31"},{"key":"4_CR11","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolio design: Theory vs. practice. arXiv preprint arXiv:1302.1541 (2013)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Hofferek, G., Gupta, A., K\u00f6nighofer, B., Jiang, J.R., Bloem, R.: Synthesizing multiple Boolean functions using interpolation on a single proof. In: Proc. 2013 IEEE Conf. Formal Methods in Computer-Aided Design. pp. 77\u201384. IEEE (2013)","DOI":"10.1109\/FMCAD.2013.6679394"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"John, A.K., Shah, S., Chakraborty, S., Trivedi, A., Akshay, S.: Skolem functions for factored formulas. In: Proc. 2015 IEEE Conf. Formal Methods in Computer-Aided Design. pp. 73\u201380. IEEE (2015)","DOI":"10.1109\/FMCAD.2015.7542255"},{"key":"4_CR14","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4, Pre-Fascicle 1B: A Draft of Section 7.1.4: Binary Decision Diagrams. Addison-Wesley Professional, 12th edn. (2009)"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Kukula, J.H., Shiple, T.R.: Building circuits from relations. In: Proc. 12th Int\u2019l Conf. on Computer Aided Verification. Lecture Notes in Computer Science, vol. 1855, pp. 113\u2013123. Springer (2000). https:\/\/doi.org\/10.1007\/10722167_12","DOI":"10.1007\/10722167_12"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proc. 30th Design Automation Conference. pp. 272\u2013277. ACM Press (1993). https:\/\/doi.org\/10.1145\/157485.164890","DOI":"10.1145\/157485.164890"},{"key":"4_CR17","unstructured":"Mishchenko, A.: Introduction to zero-suppressed decision diagrams. Synthesis Lectures on Digital Circuits and Systems 45 (2001)"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Narizzano, M., Pulina, L., Tacchella, A.: The QBFEVAL web portal. In: Proc. 10th European Conf. on Logics in Artificial Intelligence. Lecture Notes in Computer Science, vol. 4160, pp. 494\u2013497. Springer (2006). https:\/\/doi.org\/10.1007\/11853886_45","DOI":"10.1007\/11853886_45"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Pan, G., Vardi, M.Y.: Symbolic decision procedures for QBF. In: Proc. 10th Int\u2019l Conf. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 3258, pp. 453\u2013467. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_34","DOI":"10.1007\/978-3-540-30201-8_34"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Rabe, M.N., Seshia, S.A.: Incremental determinization. In: Proc. 19th Int\u2019l Conf. on Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, vol. 9710, pp. 375\u2013392. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_23","DOI":"10.1007\/978-3-319-40970-2_23"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Sasao, T., Butler, J.T.: Applications of zero-suppressed decision diagrams. Synthesis Lectures on Digital Circuits and Systems 9(2), 1\u2013123 (2014)","DOI":"10.2200\/S00612ED1V01Y201411DCS045"},{"key":"4_CR22","unstructured":"Somenzi, F.: CUDD: CU Decision Diagram Package Release 3.0.0. University of Colorado at Boulder (2015)"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Tabajara, L.M., Vardi, M.Y.: Factored Boolean functional synthesis. In: Proc. 2017 IEEE Conf. on Formal Methods in Computer Aided Design. pp. 124\u2013131. IEEE (2017). https:\/\/doi.org\/10.23919\/FMCAD.2017.8102250","DOI":"10.23919\/FMCAD.2017.8102250"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, S., Tabajara, L.M., Li, J., Pu, G., Vardi, M.Y.: Symbolic LTLf synthesis. In: Proc. 26th Int\u2019l Joint Conf. on Artificial Intelligence. pp. 1362\u20131369. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/189"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99524-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T16:59:10Z","timestamp":1675097950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99524-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030995232","9783030995249"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99524-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2022\/tacas","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"159","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report are also included in the proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}