{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:54:55Z","timestamp":1768276495433,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031331695","type":"print"},{"value":"9783031331701","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_28","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"464-471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Adiar 1.1"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0963-6569","authenticated-orcid":false,"given":"Steffan Christ","family":"S\u00f8lvsten","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4305-0625","authenticated-orcid":false,"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988). https:\/\/doi.org\/10.1145\/48529.48535","DOI":"10.1145\/48529.48535"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-88885-5_10","volume-title":"Automated Technology for Verification and Analysis","author":"D Beyer","year":"2021","unstructured":"Beyer, D., Friedberger, K., Holzner, S.: PJBDD: a BDD library for Java and multi-threading. In: Hou, Z., Ganesh, V. (eds.) ATVA 2021. LNCS, vol. 12971, pp. 144\u2013149. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88885-5_10"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"BrandVan den Brand, M.G.J., Jongde Jong, H.A., Klint, P., Olivier, P.: Efficient annotated terms. Softw. Pract. Exp. 30, 259\u2013291 (2000)","DOI":"10.1002\/(SICI)1097-024X(200003)30:3<259::AID-SPE298>3.0.CO;2-Y"},{"issue":"9","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1016\/j.jsc.2008.02.017","volume":"44","author":"M Brickenstein","year":"2009","unstructured":"Brickenstein, M., Dreyer, A.: PolyBoRi: a framework for Gr\u00f6bner-basis computations with Boolean polynomials. J. Symb. Comput. 44(9), 1326\u20131345 (2009). https:\/\/doi.org\/10.1016\/j.jsc.2008.02.017","journal-title":"J. Symb. Comput."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35(8), 677\u2013691 (1986)","DOI":"10.1109\/TC.1986.1676819"},{"key":"28_CR6","unstructured":"Bryant, R.E.: Cloud-BDD: Distributed implementation of BDD package (2021). https:\/\/github.com\/rebryant\/Cloud-BDD"},{"key":"28_CR7","doi-asserted-by":"publisher","unstructured":"Coudert, O., Madre, J.C.: A unified framework for the formal verification of sequential circuits. In: 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers, pp. 126\u2013129 (1990). https:\/\/doi.org\/10.1109\/ICCAD.1990.129859","DOI":"10.1109\/ICCAD.1990.129859"},{"key":"28_CR8","doi-asserted-by":"publisher","unstructured":"Van Dijk, T., Van de Pol, J.: Sylvan: multi-core framework for decision diagrams. Int. J. Softw. Tools Technol. Transf. 19, 675\u2013696 (2016). https:\/\/doi.org\/10.1007\/s10009-016-0433-2","DOI":"10.1007\/s10009-016-0433-2"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008647823331","volume":"10","author":"M Fujita","year":"1997","unstructured":"Fujita, M., McGeer, P., Yang, J.Y.: Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. Formal Methods Syst. Des. 10, 149\u2013169 (1997). https:\/\/doi.org\/10.1023\/A:1008647823331","journal-title":"Formal Methods Syst. Des."},{"issue":"1","key":"28_CR10","first-page":"9","volume":"4","author":"T Kam","year":"1998","unstructured":"Kam, T., Villa, T., Brayton, R.K., Alberto, L.S.V.: Multi-valued decision diagrams: theory and applications. Multiple-Valued Log. 4(1), 9\u201362 (1998)","journal-title":"Multiple-Valued Log."},{"key":"28_CR11","doi-asserted-by":"publisher","unstructured":"Kebschull, U., Rosenstiel, W.: Efficient graph-based computation and manipulation of functional decision diagrams. In: European Conference on Design Automation with the European Event in ASIC Design, pp. 278\u2013282 (1993). https:\/\/doi.org\/10.1109\/EDAC.1993.386463","DOI":"10.1109\/EDAC.1993.386463"},{"key":"28_CR12","doi-asserted-by":"publisher","unstructured":"Larsen, K.G., Weise, C., Yi, W., Pearson, J.: Clock difference diagrams. In: Nordic Workshop on Programming Theory, Turku, Finland. Aalborg Universitetsforlag (1998). https:\/\/doi.org\/10.7146\/brics.v5i46.19491","DOI":"10.7146\/brics.v5i46.19491"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.4304\/jsw.7.6.1358-1366","volume":"7","author":"R Meolic","year":"2012","unstructured":"Meolic, R.: BiDDy - a multi-platform academic BDD package. J. Softw. 7, 1358\u20131366 (2012). https:\/\/doi.org\/10.4304\/jsw.7.6.1358-1366","journal-title":"J. Softw."},{"key":"28_CR14","doi-asserted-by":"publisher","unstructured":"Miller, D., Thornton, M.: QMDD: a decision diagram structure for reversible and quantum circuits. In: 36th International Symposium on Multiple-Valued Logic, pp. 30\u201336 (2006). https:\/\/doi.org\/10.1109\/ISMVL.2006.35","DOI":"10.1109\/ISMVL.2006.35"},{"key":"28_CR15","doi-asserted-by":"publisher","unstructured":"Minato, S.I.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of the 30th International Design Automation Conference, pp. 272\u2013277. DAC 1993, Association for Computing Machinery (1993). https:\/\/doi.org\/10.1145\/157485.164890","DOI":"10.1145\/157485.164890"},{"key":"28_CR16","doi-asserted-by":"publisher","unstructured":"Sanghavi, J.V., Ranjan, R.K., Brayton, R.K., Sangiovanni-Vincentelli, A.: High performance BDD package by exploiting memory hierarchy. In: 33rd Design Automation Conference (DAC), pp. 635\u2013640. Association for Computing Machinery (1996). https:\/\/doi.org\/10.1145\/240518.240638","DOI":"10.1145\/240518.240638"},{"key":"28_CR17","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C., Jakobsen, A.B.: SSoelvsten\/bdd-benchmark: NASA formal methods 2023. Zenodo, September 2022. https:\/\/doi.org\/10.5281\/zenodo.7040263","DOI":"10.5281\/zenodo.7040263"},{"key":"28_CR18","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C., van de Pol, J.: Adiar 1.1.0: experiment data. Zenodo, March 2023. https:\/\/doi.org\/10.5281\/zenodo.7709134","DOI":"10.5281\/zenodo.7709134"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-030-99527-0_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"SC S\u00f8lvsten","year":"2022","unstructured":"S\u00f8lvsten, S.C., de Pol, J., Jakobsen, A.B., Thomasen, M.W.B.: Adiar binary decision diagrams in external memory. In: TACAS 2022. LNCS, vol. 13244, pp. 295\u2013313. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_16"},{"key":"28_CR20","unstructured":"Somenzi, F.: CUDD: CU decision diagram package, 3.0. Technical report, University of Colorado at Boulder (2015)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0031826","volume-title":"Formal Methods in Computer-Aided Design","author":"T Yoneda","year":"1996","unstructured":"Yoneda, T., Hatori, H., Takahara, A., Minato, S.: BDDs vs. zero-suppressed BDDs: for CTL symbolic model checking of Petri nets. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 435\u2013449. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0031826"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T13:00:09Z","timestamp":1685710809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_28"}},"subtitle":["Zero-Suppressed Decision Diagrams in External Memory"],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","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":"75","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":"26","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":"3","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":"35% - 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.9","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":"6","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)"}}]}}