{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T13:19:05Z","timestamp":1782911945888,"version":"3.54.5"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227485","type":"print"},{"value":"9783032227492","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]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    <jats:sc>Goblint<\/jats:sc>\n                    is a static analyzer for C programs based on abstract interpretation. It provides a flexible framework for combining analyses and specifying what information is tracked flow- and context-sensitively. For SV-COMP 2026, we adopt a sequential portfolio of configurations of increasing precision that exploits\n                    <jats:sc>Goblint<\/jats:sc>\n                    \u2019s rich family of abstract domains and sensitivity options. We have improved the analyses by adding bit-level and sparse affine equalities domains, new forms of path-sensitivity, and a context gas mechanism that controls context-sensitivity for recursive programs.\n                    <jats:sc>Goblint<\/jats:sc>\n                    continues its unblemished track record of sound verification across all SV-COMP benchmarks.\n                  <\/jats:p>","DOI":"10.1007\/978-3-032-22749-2_26","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:13:39Z","timestamp":1776258819000},"page":"516-522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Goblint: A Portfolio for Mixed Flow-Sensitive Abstract Interpretation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4553-1350","authenticated-orcid":false,"given":"Simmo","family":"Saan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9019-0852","authenticated-orcid":false,"given":"Ali Rasim","family":"Kocal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7868-651X","authenticated-orcid":false,"given":"Michael","family":"Petter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3725-4131","authenticated-orcid":false,"given":"Karoliine","family":"Holter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1729-3925","authenticated-orcid":false,"given":"Julian","family":"Erhard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9828-0308","authenticated-orcid":false,"given":"Michael","family":"Schwarz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4336-7980","authenticated-orcid":false,"given":"Vesal","family":"Vojdani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2135-1593","authenticated-orcid":false,"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"26_CR1","unstructured":"Apinis, K.: Frameworks for analyzing multi-threaded C. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen (2014)"},{"key":"26_CR2","doi-asserted-by":"publisher","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis. In: APLAS \u201912, pp. 157\u2013172, Springer (2012), $$\\text{DOI:}$$https:\/\/doi.org\/10.1007\/978-3-642-35182-2_12","DOI":"10.1007\/978-3-642-35182-2_12"},{"key":"26_CR3","doi-asserted-by":"publisher","unstructured":"Baier, D., Beyer, D., Chien, P.C., Jankola, M., Kettl, M., Lee, N.Z., Lemberger, T., Lingsch-Rosenfeld, M., Spiessl, M., Wachowitz, H., Wendler, P.: CPAchecker 2.3 with strategy selection. In: TACAS \u201924, pp. 359\u2013364, Springer (2024), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-031-57256-2_21","DOI":"10.1007\/978-3-031-57256-2_21"},{"key":"26_CR4","doi-asserted-by":"publisher","unstructured":"Beyer, D., L\u00f6we, S.: Explicit-state software model checking based on CEGAR and interpolation. In: FASE \u201913, pp. 146\u2013162, Springer (2013), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-642-37057-1_11","DOI":"10.1007\/978-3-642-37057-1_11"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Beyer, D., Strejcek, J.: Evaluating software verifiers for C, Java, and SV-LIB (report on SV-COMP 2026). In: TACAS \u201926, Springer (2026)","DOI":"10.1007\/978-3-032-22749-2_23"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Erhard, J., Bentele, M., Heizmann, M., Klumpp, D., Saan, S., Sch\u00fcssele, F., Schwarz, M., Seidl, H., Tilscher, S., Vojdani, V.: Correctness witnesses for concurrent programs: Bridging the semantic divide with ghosts. In: VMCAI \u201925, pp. 74\u2013100, Springer (2025), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-031-82700-6_4","DOI":"10.1007\/978-3-031-82700-6_4"},{"key":"26_CR7","doi-asserted-by":"publisher","unstructured":"Erhard, J., Schinabeck, J.F., Schwarz, M., Seidl, H.: When to stop going down the rabbit hole: Taming context-sensitivity on the fly. In: SOAP \u201924, pp. 35\u201344, ACM (2024), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1145\/3652588.3663321","DOI":"10.1145\/3652588.3663321"},{"key":"26_CR8","doi-asserted-by":"publisher","unstructured":"Erhard, J., Schinabeck, J.F., Schwarz, M., Seidl, H.: Context gas and friends: taming context-sensitivity on the fly. Int. J. Softw. Tools Technol. Transf. 27(2), 289\u2013307 (2025), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/S10009-025-00803-3","DOI":"10.1007\/S10009-025-00803-3"},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Handjieva, M., Tzolovski, S.: Refining static analyses by trace-based partitioning using control flow. In: SAS \u201998, pp. 200\u2013214, Springer (1998), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/3-540-49727-7_12","DOI":"10.1007\/3-540-49727-7_12"},{"key":"26_CR10","doi-asserted-by":"publisher","unstructured":"Jeannet, B., Min\u00e9, A.: Apron: A library of numerical abstract domains for static analysis. In: CAV \u201909, pp. 661\u2013667, Springer (2009), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-642-02658-4_52","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Karr, M.: Affine relationships among variables of a program. Acta Informatica 6(2), 133\u2013151 (1976), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/BF00268497","DOI":"10.1007\/BF00268497"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Kocal, A.R., Schwarz, M., Saan, S., Seidl, H.: Same engine, multiple gears: Parallelizing fixpoint iteration at different granularities. In: TACAS \u201926, Springer (2026)","DOI":"10.1007\/978-3-032-22749-2_9"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Mine, A.: Abstract domains for bit-level machine integer and floating-point operations. In: WInG \u201912, pp. 55\u201370, EasyChair (2013), $$\\text{ DOI: }$$https:\/\/doi.org\/10.29007\/b63g","DOI":"10.29007\/b63g"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Monat, R., Ouadjaout, A., Mine, A.: Mopsa-C: Modular domains and relational abstract interpretation for C programs. In: TACAS \u201923, pp. 565\u2013570, Springer (2023), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-031-30820-8_37","DOI":"10.1007\/978-3-031-30820-8_37"},{"key":"26_CR15","doi-asserted-by":"publisher","unstructured":"Monat, R., Ouadjaout, A., Mine, A.: Mopsa-C with trace partitioning and autosuggestions. In: TACAS \u201925, pp. 229\u2013235, Springer (2025), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-031-90660-2_17","DOI":"10.1007\/978-3-031-90660-2_17"},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"Necula, G.C., McPeak, S., Rahul, S.P., Weimer, W.: CIL: Intermediate language and tools for analysis and transformation of C programs. In: CC \u201902, pp. 213\u2013228, Springer (2002), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/3-540-45937-5_16","DOI":"10.1007\/3-540-45937-5_16"},{"key":"26_CR17","doi-asserted-by":"publisher","unstructured":"Rival, X., Mauborgne, L.: The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst. 29(5), 26\u2013es (2007), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1145\/1275497.1275501","DOI":"10.1145\/1275497.1275501"},{"key":"26_CR18","doi-asserted-by":"publisher","unstructured":"Saan, S., Erhard, J., Schwarz, M., Bozhilov, S., Holter, K., Tilscher, S., Vojdani, V., Seidl, H.: Goblint: Abstract interpretation for memory safety and termination. In: TACAS \u201924, pp. 381\u2013386, Springer (2024), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-031-57256-2_25","DOI":"10.1007\/978-3-031-57256-2_25"},{"key":"26_CR19","doi-asserted-by":"publisher","unstructured":"Saan, S., Erhard, J., Schwarz, M., Bozhilov, S., Holter, K., Tilscher, S., Vojdani, V., Seidl, H.: Goblint Validator: Correctness witness validation by abstract interpretation. In: TACAS \u201924, pp. 335\u2013340, Springer (2024), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-031-57256-2_17","DOI":"10.1007\/978-3-031-57256-2_17"},{"key":"26_CR20","doi-asserted-by":"publisher","unstructured":"Saan, S., Kocal, A.R., Petter, M., Holter, K., Erhard, J., Schwarz, M., Vojdani, V., Seidl, H.: Goblint in SV-COMP 2026 (2025), $$\\text{ DOI: }$$https:\/\/doi.org\/10.5281\/zenodo.17642247, tool artifact","DOI":"10.5281\/zenodo.17642247"},{"key":"26_CR21","doi-asserted-by":"publisher","unstructured":"Saan, S., Schwarz, M., Apinis, K., Erhard, J., Seidl, H., Vogler, R., Vojdani, V.: Goblint: Thread-modular abstract interpretation using side-effecting constraints. In: TACAS \u201921, pp. 438\u2013442, Springer (2021), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-030-72013-1_28","DOI":"10.1007\/978-3-030-72013-1_28"},{"key":"26_CR22","doi-asserted-by":"publisher","unstructured":"Saan, S., Schwarz, M., Erhard, J., Pietsch, M., Seidl, H., Tilscher, S., Vojdani, V.: Goblint: Autotuning thread-modular abstract interpretation. In: TACAS \u201923, vol.\u00a02, pp. 547\u2013552, Springer (2023), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-031-30820-8_34","DOI":"10.1007\/978-3-031-30820-8_34"},{"key":"26_CR23","unstructured":"Schwarz, M.: Thread-Modular Abstract Interpretation: The Local Perspective. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen (2025), https:\/\/d-nb.info\/137113345X\/34"},{"key":"26_CR24","doi-asserted-by":"publisher","unstructured":"Schwarz, M., Erhard, J.: The digest framework: concurrency-sensitivity for abstract interpretation. Int. J. Softw. Tools Technol. Transf. 26(6), 727\u2013746 (2024), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/s10009-024-00773-y","DOI":"10.1007\/s10009-024-00773-y"},{"key":"26_CR25","doi-asserted-by":"publisher","unstructured":"Schwarz, M., Erhard, J.: Data race detection by digest-driven abstract interpretation. In: VMCAI \u201926, Springer (2026), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-032-15700-3_15","DOI":"10.1007\/978-3-032-15700-3_15"},{"key":"26_CR26","doi-asserted-by":"publisher","unstructured":"Schwarz, M., Saan, S., Seidl, H., Apinis, K., Erhard, J., Vojdani, V.: Improving thread-modular abstract interpretation. In: SAS \u201921, pp. 359\u2013383, Springer (2021), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-030-88806-0_18","DOI":"10.1007\/978-3-030-88806-0_18"},{"key":"26_CR27","doi-asserted-by":"publisher","unstructured":"Schwarz, M., Saan, S., Seidl, H., Erhard, J., Vojdani, V.: Clustered relational thread-modular abstract interpretation with local traces. In: ESOP \u201923, pp. 28\u201358, Springer (2023), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-031-30044-8_2","DOI":"10.1007\/978-3-031-30044-8_2"},{"key":"26_CR28","doi-asserted-by":"publisher","unstructured":"Seidl, H., Vogler, R.: Three improvements to the top-down solver. Math. Struct. Comput. Sci. 31(9), 1090\u20131134 (2021), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1017\/S0960129521000499","DOI":"10.1017\/S0960129521000499"},{"key":"26_CR29","doi-asserted-by":"publisher","unstructured":"Stemmler, F., Schwarz, M., Erhard, J., Tilscher, S., Seidl, H.: Taking out the toxic trash: Recovering precision in mixed flow-sensitive static analyses. In: PLDI \u201925, pp. 1167\u20131193, ACM (2025), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1145\/3729297","DOI":"10.1145\/3729297"},{"key":"26_CR30","doi-asserted-by":"publisher","unstructured":"Vojdani, V., Apinis, K., R\u00f5tov, V., Seidl, H., Vene, V., Vogler, R.: Static Race Detection for Device Drivers: The Goblint Approach. In: ASE \u201916, pp. 391\u2013402, ACM (2016), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1145\/2970276.2970337","DOI":"10.1145\/2970276.2970337"},{"key":"26_CR31","doi-asserted-by":"publisher","unstructured":"Wendler, P.: CPAchecker with sequential combination of explicit-state analysis and predicate analysis. In: TACAS \u201913, pp. 613\u2013615, Springer (2013), $$\\text{ DOI: }$$https:\/\/doi.org\/10.1007\/978-3-642-36742-7_45","DOI":"10.1007\/978-3-642-36742-7_45"}],"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-032-22749-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:29:03Z","timestamp":1782865743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22749-2_26"}},"subtitle":["(Competition Contribution)"],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227485","9783032227492"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22749-2_26","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":"15 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"All data of SV-COMP 2026 are archived as described in the competition report\u00a0[\n                      \n                      ] and available on the\n                      \n                      . This includes the verification tasks, results, witnesses, scripts, and instructions for reproduction. The version of\n                      Goblint\n                      as used in the competition is archived on Zenodo\u00a0[\n                      \n                      ], while the corresponding source code is available on\n                      \n                      .","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data Availability Statement"}},{"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":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}