{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T10:26:33Z","timestamp":1768213593583,"version":"3.49.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156990","type":"print"},{"value":"9783032157003","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-15700-3_17","type":"book-chapter","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:21:50Z","timestamp":1768202510000},"page":"359-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-variable Quantification of\u00a0BDDs in\u00a0External Memory using Nested Sweeping"],"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":[[2026,1,13]]},"reference":[{"issue":"9","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","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","journal-title":"Commun. ACM"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. C-27(6), 509\u2013516 (1978). https:\/\/doi.org\/10.1109\/TC.1978.1675141","DOI":"10.1109\/TC.1978.1675141"},{"key":"17_CR3","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.823","volume":"8","author":"EG Amparore","year":"2022","unstructured":"Amparore, E.G., Donatelli, S., Gall\u00e0, F.: starMC: an automata based CTL* model checker. PeerJ Comput. Sci. 8, e823 (2022)","journal-title":"PeerJ Comput. Sci."},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Arge, L.: The buffer tree: a new technique for optimal I\/O-algorithms. In: Akl, S.G., Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 334\u2013345. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60220-8_74","DOI":"10.1007\/3-540-60220-8_74"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Arge, L.: The I\/O-complexity of ordered binary-decision diagram manipulation. In: Proceedings of International Symposium on Algorithms and Computations, ISAAC\u201995, pp. 82\u201391 (1995)","DOI":"10.1007\/BFb0015411"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Arge, L.: The I\/O-complexity of ordered binary-decision diagram manipulation. In: Efficient External-Memory Data Structures and Applications (PhD Thesis), pp. 123\u2013145. Aarhus Universitet, Datalogisk Institut (1996)","DOI":"10.7146\/brics.v3i29.20010"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Ashar, P., Cheong, M.: Efficient breadth-first manipulation of binary decision diagrams. In: IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pp. 622\u2013627. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/ICCAD.1994.629886","DOI":"10.1109\/ICCAD.1994.629886"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Beer, R.D.: Cultivating the garden of Eden. arXiv (2022). https:\/\/doi.org\/10.48550\/arXiv.2210.07837","DOI":"10.48550\/arXiv.2210.07837"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-030-53288-8_28","volume-title":"Computer Aided Verification","author":"N Bene\u0161","year":"2020","unstructured":"Bene\u0161, N., Brim, L., Kadlecaj, J., Pastva, S., \u0160afr\u00e1nek, D.: AEON: attractor bifurcation analysis of parametrised Boolean networks. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 569\u2013581. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_28"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Brace, K.S., Rudell, R.L., Bryant, R.E.: Efficient implementation of a BDD package. In: 27th Design Automation Conference (DAC), pp. 40\u201345. Association for Computing Machinery (1990). https:\/\/doi.org\/10.1109\/DAC.1990.114826","DOI":"10.1109\/DAC.1990.114826"},{"issue":"9","key":"17_CR11","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":"17_CR12","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":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-030-99524-9_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"RE Bryant","year":"2022","unstructured":"Bryant, R.E., Biere, A., Heule, M.J.H.: Clausal proofs for pseudo-boolean reasoning. In: TACAS 2022. LNCS, vol. 13243, pp. 443\u2013461. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_25"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-030-79876-5_25","volume-title":"Automated Deduction \u2013 CADE 28","author":"RE Bryant","year":"2021","unstructured":"Bryant, R.E., Heule, M.J.H.: Dual proof generation for quantified boolean formulas with a BDD-based solver. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 433\u2013449. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_25"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-030-72016-2_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"RE Bryant","year":"2021","unstructured":"Bryant, R.E., Heule, M.J.H.: Generating extended resolution proofs with a BDD-based SAT solver. In: TACAS 2021. LNCS, vol. 12651, pp. 76\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_5"},{"key":"17_CR16","unstructured":"Chen, J., Revels, J.: Robust benchmarking in noisy environments. arXiv (2016). https:\/\/arxiv.org\/abs\/1608.04295"},{"key":"17_CR17","unstructured":"Chiang, Y.J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201995, pp. 139\u2013149. Society for Industrial and Applied Mathematics (1995)"},{"issue":"4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/1530873.1530885","volume":"36","author":"G Ciardo","year":"2009","unstructured":"Ciardo, G., Miner, A.S., Wan, M.: Advanced features in SMART: the stochastic model checking analyzer for reliability and timing. SIGMETRICS Perf. Eval. Rev. 36(4), 58\u201363 (2009)","journal-title":"SIGMETRICS Perf. Eval. Rev."},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s100090050046","volume":"2","author":"A Cimatti","year":"2000","unstructured":"Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NuSMV: a new symbolic model checker. Int. J. Softw. Tools Technol. Transfer 2, 410\u2013425 (2000). https:\/\/doi.org\/10.1007\/s100090050046","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"van Dijk, T., van de Pol, J.: Sylvan: multi-core framework for decision diagrams. Int. J. Softw. Tools Technol. Transfer 1\u201322 (2016). https:\/\/doi.org\/10.1007\/s10009-016-0433-2","DOI":"10.1007\/s10009-016-0433-2"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-319-41540-6_22","volume-title":"Computer Aided Verification","author":"D Fried","year":"2016","unstructured":"Fried, D., Tabajara, L.M., Vardi, M.Y.: BDD-based boolean functional synthesis. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 402\u2013421. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_22"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-27813-9_41","volume-title":"Computer Aided Verification","author":"P Gammie","year":"2004","unstructured":"Gammie, P., van der Meyden, R.: MCK: model checking the logic of knowledge. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 479\u2013483. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27813-9_41"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Gardner, M.: The fantastic combinations of John Conway\u2019s new solitaire game \u201clife\". Sci. Am. 223(4), 120\u2013123 (1970). https:\/\/doi.org\/10.1038\/scientificamerican1070-120","DOI":"10.1038\/scientificamerican1070-120"},{"key":"17_CR24","unstructured":"He, L., Liu, G.: Petri net based symbolic model checking for computation tree logic of knowledge. arXiv (2020). https:\/\/arxiv.org\/abs\/2012.10126"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Husung, N., Dubslaff, C., Hermanns, H., K\u00f6hl, M.A.: OxiDD: a safe, concurrent, modular, and performant decision diagram framework in Rust. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201924). LNCS, vol. 14572. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-57256-2_13","DOI":"10.1007\/978-3-031-57256-2_13"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/978-3-662-46681-0_61","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Kant","year":"2015","unstructured":"Kant, G., Laarman, A., Meijer, J., van de Pol, J., Blom, S., van Dijk, T.: LTSmin: high-performance language-independent model checking. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 692\u2013707. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_61"},{"key":"17_CR27","unstructured":"Karplus, K.: Representing boolean functions with if-then-else DAGs. Technical report. University of California at Santa Cruz, USA (1988)"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Klarlund, N., Rauhe, T.: BDD algorithms and cache misses. In: BRICS Report Series, vol.\u00a026 (1996). https:\/\/doi.org\/10.7146\/brics.v3i26.20007","DOI":"10.7146\/brics.v3i26.20007"},{"issue":"4","key":"17_CR29","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"CY Lee","year":"1959","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. Bell Syst. Techn. J. 38(4), 985\u2013999 (1959). https:\/\/doi.org\/10.1002\/j.1538-7305.1959.tb01585.x","journal-title":"Bell Syst. Techn. J."},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-99524-9_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Lin","year":"2022","unstructured":"Lin, Y., Tabajara, L.M., Vardi, M.Y.: ZDD boolean synthesis. In: TACAS 2022. LNCS, vol. 13243, pp. 64\u201383. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_4"},{"key":"17_CR31","unstructured":"Lind-Nielsen, J.: BuDDy: a binary decision diagram package. Technical report, Department of Information Technology, Technical University of Denmark (1999)"},{"issue":"1","key":"17_CR32","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10009-015-0378-x","volume":"19","author":"A Lomuscio","year":"2015","unstructured":"Lomuscio, A., Qu, H., Raimondi, F.: MCMAS: an open-source model checker for the verification of multi-agent systems. Int. J. Softw. Tools Technol. Transfer 19(1), 9\u201330 (2015). https:\/\/doi.org\/10.1007\/s10009-015-0378-x","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"Madsen, M., Van de Pol, J.: Polymorphic types and effects with Boolean unification. Proc. ACM Program. Lang. 4(OOPSLA) (2020). https:\/\/doi.org\/10.1145\/3428222","DOI":"10.1145\/3428222"},{"key":"17_CR34","doi-asserted-by":"publisher","unstructured":"Madsen, M., Van de Pol, J., Henriksen, T.: Fast and efficient boolean unification for Hindley-Milner-style type and effect systems. Proc. ACM Program. Lang. 7(OOPSLA 2) (2023). https:\/\/doi.org\/10.1145\/3622816","DOI":"10.1145\/3622816"},{"key":"17_CR35","unstructured":"Michaud, T., Colange, M.: Reactive synthesis from LTL specification with Spot. In: 7th Workshop on Synthesis, SYNT@ CAV, vol.\u00a05 (2018)"},{"key":"17_CR36","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":"17_CR37","doi-asserted-by":"publisher","unstructured":"Minato, S.i., Ishihara, S.: Streaming BDD manipulation for large-scale combinatorial problems. In: Design, Automation and Test in Europe Conference and Exhibition, pp. 702\u2013707 (2001). https:\/\/doi.org\/10.1109\/DATE.2001.915104","DOI":"10.1109\/DATE.2001.915104"},{"key":"17_CR38","doi-asserted-by":"publisher","unstructured":"Minato, S.i., Ishiura, N., Yajima, S.: Shared binary decision diagram with attributed edges for efficient Boolean function manipulation. In: 27th Design Automation Conference, pp. 52\u201357. Association for Computing Machinery (1990). https:\/\/doi.org\/10.1145\/123186.123225","DOI":"10.1145\/123186.123225"},{"key":"17_CR39","doi-asserted-by":"publisher","unstructured":"Moore, E.F.: Machine models of self-reproduction. In: Proceedings of Symposia in Applied Mathematics, vol.\u00a014, pp. 17\u201333 (1962). https:\/\/doi.org\/10.1090\/psapm\/014","DOI":"10.1090\/psapm\/014"},{"key":"17_CR40","doi-asserted-by":"publisher","unstructured":"Ochi, H., Yasuoka, K., Yajima, S.: Breadth-first manipulation of very large binary-decision diagrams. In: International Conference on Computer Aided Design (ICCAD), pp. 48\u201355. IEEE Computer Society Press (1993). https:\/\/doi.org\/10.1109\/ICCAD.1993.580030","DOI":"10.1109\/ICCAD.1993.580030"},{"key":"17_CR41","unstructured":"Pastva, S., Henzinger, T.: Binary decision diagrams on modern hardware. In: Conference on Formal Methods in Computer-Aided Design, pp. 122\u2013131 (2023)"},{"key":"17_CR42","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/s10703-022-00407-6","volume":"61","author":"F Renkin","year":"2022","unstructured":"Renkin, F., Schlehuber-Caissier, P., Duret-Lutz, A., Pommellet, A.: Dissecting ltlsynt. Formal Methods Syst. Des. 61, 248\u2013289 (2022). https:\/\/doi.org\/10.1007\/s10703-022-00407-6","journal-title":"Formal Methods Syst. Des."},{"key":"17_CR43","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":"17_CR44","doi-asserted-by":"publisher","unstructured":"Shaik, I., Van de Pol, J.: Concise QBF encodings for games on a grid (extended version). arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2303.16949","DOI":"10.48550\/arXiv.2303.16949"},{"key":"17_CR45","unstructured":"S\u00f8lvsten, S.C.: I\/O-efficient Symbolic Model Checking. Phd thesis, Aarhus University (2025). https:\/\/soeg.kb.dk\/permalink\/45KBDK_KGL\/1pioq0f\/alma99126389524805763"},{"key":"17_CR46","unstructured":"S\u00f8lvsten, S.C., van\u00a0de Pol, J.: Multi-variable quantification of BDDs in external memory using nested sweeping (extended paper). arXiv (2024). https:\/\/arxiv.org\/abs\/2408.14216"},{"key":"17_CR47","unstructured":"S\u00f8lvsten, S.C., van\u00a0de Pol, J.: Symbolic model checking in external memory. arXiv (2025). https:\/\/arxiv.org\/abs\/2505.11229"},{"key":"17_CR48","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C., Van de Pol, J.: Adiar 1.1: Zero-suppressed decision diagrams in external memory. In: NASA Formal Methods Symposium. LNCS, vol. 13903, Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-33170-1_28","DOI":"10.1007\/978-3-031-33170-1_28"},{"key":"17_CR49","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":"17_CR50","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C., Rysgaard, C.M., Van de Pol, J.: Random access on narrow decision diagrams in external memory. In: Model Checking Software, pp. 137\u2013145. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-66149-5_7","DOI":"10.1007\/978-3-031-66149-5_7"},{"key":"17_CR51","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C., Van de Pol, J.: Predicting memory demands of BDD Operations using maximum graph cuts. In: Andr\u00e9, \u00c9., Sun, J. (eds.) Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, vol. 14216, pp. 72\u201392. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-45332-8_4","DOI":"10.1007\/978-3-031-45332-8_4"},{"key":"17_CR52","unstructured":"Somenzi, F.: CUDD: CU decision diagram package, 3.0. Technical report, University of Colorado at Boulder (2015)"},{"key":"17_CR53","doi-asserted-by":"publisher","unstructured":"Van Dijk, T., Van Abbema, F., Tomov, N.: Knor: reactive synthesis using oink. In: Tools and Algorithms for the Construction and Analysis of Systems. pp. 103\u2013122. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-57246-3_7","DOI":"10.1007\/978-3-031-57246-3_7"},{"key":"17_CR54","unstructured":"QBF Gallery 2014: QCIR-G14: a non-prenex non-CNF format for quantified Boolean formulas (2014)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15700-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:21:55Z","timestamp":1768202515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15700-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156990","9783032157003"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15700-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/VMCAI-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}