{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:09:47Z","timestamp":1776305387875,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031572555","type":"print"},{"value":"9783031572562","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"vor","delay-in-days":95,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:sc>Bubaak<\/jats:sc>-SpLit is a tool for dynamically splitting verification tasks into parts that can then be analyzed in parallel. It is built on top of<jats:sc>Bubaak<\/jats:sc>, a tool designed for running combinations of verifiers in parallel. In contrast to<jats:sc>Bubaak<\/jats:sc>, that directly invokes verifiers on the inputs,<jats:sc>Bubaak<\/jats:sc>-SpLit first starts by splitting the input program into multiple modified versions called<jats:italic>program splits<\/jats:italic>. During the splitting process,<jats:sc>Bubaak<\/jats:sc>-SpLit utilizes a<jats:italic>weak<\/jats:italic>verifier (in our case symbolic execution with a short timelimit) to analyze each generated program split. If the weak verifier fails on a program split, we split this program split again and start the verification process again on the generated program splits. We run the splitting process until a predefined number of<jats:italic>hard-to-verify<\/jats:italic>program splits is generated or a splitting limit is reached. During the main verification phase, we run a combination of<jats:sc>Bubaak<\/jats:sc>-<jats:sc>Lee<\/jats:sc>and<jats:sc>Slowbeast<\/jats:sc>in parallel on the remaining unsolved parts of the verification task.<\/jats:p>","DOI":"10.1007\/978-3-031-57256-2_20","type":"book-chapter","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T08:03:04Z","timestamp":1712217784000},"page":"353-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Bubaak-SpLit: Split what you cannot verify (Competition contribution)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1132-5516","authenticated-orcid":false,"given":"Marek","family":"Chalupa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2906-6508","authenticated-orcid":false,"given":"Cedric","family":"Richter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,5]]},"reference":[{"key":"20_CR1","unstructured":"llvm.org. https:\/\/llvm.org, accessed: 2023-12-21"},{"key":"20_CR2","unstructured":"Bubaak-SpLit artifact (2023). https:\/\/zenodo.org\/records\/10202207"},{"key":"20_CR3","unstructured":"Bubaak-SpLit repository (2023), https:\/\/gitlab.com\/mchalupa\/bubaak"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Baeten, J.C., Weijland, W.P.: Process algebra. Cambridge university press (1991)","DOI":"10.1017\/CBO9780511624193"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Beyer, D.: State of the art in software verification and witness validation: SV-COMP 2024. In: Proc. TACAS. LNCS\u00a0, Springer (2024)","DOI":"10.1007\/978-3-031-57256-2_15"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Beyer, D.: State of the art in software verification and witness validation: SV-COMP 2024. In: Proc. TACAS. LNCS\u00a0, Springer (2024)","DOI":"10.1007\/978-3-031-57256-2_15"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Chalupa, M., Henzinger, T.A.: Bubaak: Runtime monitoring of program verifiers - (competition contribution). In: TACAS 2023. LNCS, vol. 13994, pp. 535\u2013540. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_32","DOI":"10.1007\/978-3-031-30820-8_32"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Chalupa, M., Strejcek, J.: Backward symbolic execution with loop folding. In: SAS 2021. LNCS, vol. 12913, pp. 49\u201376. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-88806-0_3","DOI":"10.1007\/978-3-030-88806-0_3"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"De\u00a0Moura, L., Bj\u00f8rner, N.: Z3: An efficient smt solver. In: TACAS 2008. pp. 337\u2013340. Springer (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Falcone, Y., Mariani, L., Rollet, A., Saha, S.: Runtime failure prevention and reaction. In: Lectures on Runtime Verification - Introductory and Advanced Topics, LNCS, vol. 10457, pp. 103\u2013134. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-75632-5_4","DOI":"10.1007\/978-3-319-75632-5_4"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Haltermann, J., Jakobs, M., Richter, C., Wehrheim, H.: Parallel program analysis via range splitting. In: FASE 2023. LNCS, vol. 13991, pp. 195\u2013219. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30826-0_11","DOI":"10.1007\/978-3-031-30826-0_11"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Haltermann, J., Jakobs, M., Richter, C., Wehrheim, H.: Ranged program analysis via instrumentation. In: SEFM 2023. LNCS, vol. 14323, pp. 145\u2013164. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-47115-5_9","DOI":"10.1007\/978-3-031-47115-5_9"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Handjieva, M., Tzolovski, S.: Refining static analyses by trace-based partitioning using control flow. In: SAS 1998. LNCS, vol.\u00a01503, pp. 200\u2013214. Springer (1998). https:\/\/doi.org\/10.1007\/3-540-49727-7_12","DOI":"10.1007\/3-540-49727-7_12"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976). https:\/\/doi.org\/10.1145\/360248.360252","DOI":"10.1145\/360248.360252"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Siddiqui, J.H., Khurshid, S.: Scaling symbolic execution using ranged analysis. In: OOPSLA 2012. pp. 523\u2013536. ACM (2012). https:\/\/doi.org\/10.1145\/2384616.2384654","DOI":"10.1145\/2384616.2384654"}],"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-031-57256-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T17:21:43Z","timestamp":1731691303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57256-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031572555","9783031572562"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57256-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 April 2024","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":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2024\/conferences\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"53","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":"16","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":"33% - 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)"}}]}}