{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T13:18:06Z","timestamp":1782911886805,"version":"3.54.5"},"publisher-location":"Cham","reference-count":6,"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                    We present the multi-threaded software model checker\n                    <jats:sc>Ultimate Paralizer<\/jats:sc>\n                    , which lets us use multiple CPU cores effectively.\n                    <jats:sc>Ultimate Paralizer<\/jats:sc>\n                    is built on\n                    <jats:sc>Ultimate Automizer<\/jats:sc>\n                    \u2019s automata-theoretic approach to software model checking, which performs a variant of counterexample-guided abstraction refinement. The parallelization idea of\n                    <jats:sc>Ultimate Paralizer<\/jats:sc>\n                    is simple but effective. For parallelization,\n                    <jats:sc>Ultimate Paralizer<\/jats:sc>\n                    analyzes multiple, diverse counterexample independently in parallel including the computation of an abstraction refinement if necessary. A central coordinator steers the verification process, in particular it selects the counterexamples for analysis and performs the necessary abstraction updates. In SV-COMP 2026,\n                    <jats:sc>Ultimate Paralizer<\/jats:sc>\n                    participates in the categories reach-safety and no-overflows and in the demo wall-time track.\n                  <\/jats:p>","DOI":"10.1007\/978-3-032-22749-2_38","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:12:23Z","timestamp":1776258743000},"page":"595-599","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Ultimate Paralizer: Parallel Trace Abstraction (Competition Contribution)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7716-3898","authenticated-orcid":false,"given":"Max","family":"Barth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8947-5373","authenticated-orcid":false,"given":"Daniel","family":"Dietsch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4252-3558","authenticated-orcid":false,"given":"Matthias","family":"Heizmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5890-4673","authenticated-orcid":false,"given":"Marie-Christine","family":"Jakobs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.17688158","author":"M Barth","year":"2025","unstructured":"Barth, M.: Ultimate Paralizer at SV-Comp 2026. Zenodo (2025), https:\/\/doi.org\/10.5281\/zenodo.17688158","journal-title":"Zenodo"},{"key":"38_CR2","unstructured":"Barth, M., Jakobs, M.C.: Multi-threaded software model checking via parallel trace abstraction refinement (2026), https:\/\/arxiv.org\/abs\/2509.13699v2"},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Bentele, M., Barth, M., Ebbinghaus, M., K\u00f6rner, J., Dietsch, D., Heizmann, M., Klumpp, D., Sch\u00fcssele, F., Podelski, A.: Ultimate Automizer with a one-dimensional memory model (competition contribution). In: Proc. TACAS\u00a0(2), pp. xx\u2013yy. LNCS\u00a016506, Springer (2026). https:\/\/doi.org\/10.1007\/978-3-032-22749-2_37","DOI":"10.1007\/978-3-032-22749-2_37"},{"key":"38_CR4","doi-asserted-by":"publisher","unstructured":"Beyer, D., Strej\u010dek, J.: Evaluating software verifiers for C, Java, and SV-LIB (report on SV-COMP 2026). In: Proc. TACAS\u00a0(2), pp. xx\u2013yy. LNCS\u00a016506, Springer (2026). https:\/\/doi.org\/10.1007\/978-3-032-22749-2_23","DOI":"10.1007\/978-3-032-22749-2_23"},{"key":"38_CR5","doi-asserted-by":"publisher","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Refinement of trace abstraction. In: Proc. SAS. pp. 69\u201385. LNCS\u00a05673, Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-03237-0_7","DOI":"10.1007\/978-3-642-03237-0_7"},{"key":"38_CR6","doi-asserted-by":"publisher","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Software model checking for people who love automata. In: Proc. CAV. pp. 36\u201352. LNCS\u00a08044, Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_2","DOI":"10.1007\/978-3-642-39799-8_2"}],"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_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:30:00Z","timestamp":1782865800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22749-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227485","9783032227492"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22749-2_38","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":"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"}}]}}