{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:06:25Z","timestamp":1767927985782,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031505201","type":"print"},{"value":"9783031505218","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-50521-8_1","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T08:03:15Z","timestamp":1703836995000},"page":"3-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Petrification: Software Model Checking for\u00a0Programs with\u00a0Dynamic Thread Management"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4252-3558","authenticated-orcid":false,"given":"Matthias","family":"Heizmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4885-0728","authenticated-orcid":false,"given":"Dominik","family":"Klumpp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Nitzke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5656-306X","authenticated-orcid":false,"given":"Frank","family":"Sch\u00fcssele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"1_CR1","unstructured":"Base Specifications POSIX.1-2017. Standard, The Open Group, San Francisco, CA, January 2018. https:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/"},{"key":"1_CR2","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard: version 2.6. Technical Report, Department of Computer Science, The University of Iowa (2017), www.SMT-LIB.org"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Beyer, D.: Competition on software verification and witness validation: SV-COMP 2023. In: Sankaranarayanan, S., Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2023. LNCS, vol. 13994, pp 495\u2013522. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_29","DOI":"10.1007\/978-3-031-30820-8_29"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Beyer, D., Friedberger, K.: A light-weight approach for verifying multi-threaded programs with CPAchecker. In: MEMICS. EPTCS, vol. 233, pp. 61\u201371 (2016). https:\/\/doi.org\/10.4204\/EPTCS.233.6","DOI":"10.4204\/EPTCS.233.6"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-22110-1_16","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2011","unstructured":"Beyer, D., Keremoglu, M.E.: CPAchecker: a tool for configurable software verification. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 184\u2013190. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_16"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-017-0469-y","volume":"21","author":"D Beyer","year":"2019","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw. Tools Technol. Transf. 21(1), 1\u201329 (2019). https:\/\/doi.org\/10.1007\/s10009-017-0469-y","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Grumberg, O.: Avoiding the state explosion problem in temporal logic model checking. In: PODC, pp. 294\u2013303. ACM (1987). https:\/\/doi.org\/10.1145\/41840.41865","DOI":"10.1145\/41840.41865"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-28644-8_18","volume-title":"CONCUR 2004 - Concurrency Theory","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Talupur, M., Touili, T., Veith, H.: Verification by network decomposition. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 276\u2013291. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_18"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-030-67067-2_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D Dietsch","year":"2021","unstructured":"Dietsch, D., Heizmann, M., Klumpp, D., Naouar, M., Podelski, A., Sch\u00e4tzle, C.: Verification of concurrent programs using Petri net unfoldings. In: Henglein, F., Shoham, S., Vizel, Y. (eds.) VMCAI 2021. LNCS, vol. 12597, pp. 174\u2013195. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67067-2_9"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-030-45237-7_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Dietsch","year":"2020","unstructured":"Dietsch, D., Heizmann, M., Nutz, A., Sch\u00e4tzle, C., Sch\u00fcssele, F.: Ultimate Taipan with symbolic interpretation and fluid abstractions. In: TACAS 2020. LNCS, vol. 12079, pp. 418\u2013422. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45237-7_32"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/10721959_19","volume-title":"Automated Deduction - CADE-17","author":"EA Emerson","year":"2000","unstructured":"Emerson, E.A., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol. 1831, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10721959_19"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Farzan, A., Klumpp, D., Podelski, A.: Sound sequentialization for concurrent program verification. In: PLDI, pp. 506\u2013521. ACM (2022). https:\/\/doi.org\/10.1145\/3519939.3523727","DOI":"10.1145\/3519939.3523727"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-030-25540-4_19","volume-title":"Computer Aided Verification","author":"N Gavrilenko","year":"2019","unstructured":"Gavrilenko, N., Ponce-de-Le\u00f3n, H., Furbach, F., Heljanko, K., Meyer, R.: BMC for weak memory models: relation analysis for compact SMT encodings. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 355\u2013365. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_19"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-319-66706-5_7","volume-title":"Static Analysis","author":"M Greitschus","year":"2017","unstructured":"Greitschus, M., Dietsch, D., Podelski, A.: Loop invariants from counterexamples. In: Ranzato, F. (ed.) SAS 2017. LNCS, vol. 10422, pp. 128\u2013147. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66706-5_7"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"He, F., Sun, Z., Fan, H.: Satisfiability modulo ordering consistency theory for multi-threaded program verification. In: PLDI, pp. 1264\u20131279. ACM (2021). https:\/\/doi.org\/10.1145\/3453483.3454108","DOI":"10.1145\/3453483.3454108"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Heizmann, M., et al.: Ultimate Automizer and the CommuHash Normal Form. In: Sankaranarayanan, S., Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2023, LNCS, vol. 13994, pp. 577\u2013581. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_39","DOI":"10.1007\/978-3-031-30820-8_39"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Heizmann, M., Klumpp, D., Nitzke, L., Sch\u00fcssele, F.: Petrification: Software model checking for programs with dynamic thread management (extended version). CoRR abs\/2311.01302 (2023). https:\/\/doi.org\/10.48550\/arXiv.2311.01302","DOI":"10.1007\/978-3-031-50521-8_1"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Hoenicke, J., Majumdar, R., Podelski, A.: Thread modularity at many levels: a pearl in compositional verification. In: POPL, pp. 473\u2013485. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009893","DOI":"10.1145\/3009837.3009893"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-319-08867-9_39","volume-title":"Computer Aided Verification","author":"O Inverso","year":"2014","unstructured":"Inverso, O., Tomasco, E., Fischer, B., La Torre, S., Parlato, G.: Bounded model checking of multi-threaded C programs via lazy sequentialization. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 585\u2013602. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_39"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-030-99527-0_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Klumpp","year":"2022","unstructured":"Klumpp, D., et al.: Ultimate GemCutter and the axes of generalization. In: TACAS 2022. LNCS, vol. 13244, pp. 479\u2013483. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_35"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-030-45237-7_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Ponce-de-Le\u00f3n","year":"2020","unstructured":"Ponce-de-Le\u00f3n, H., Furbach, F., Heljanko, K., Meyer, R.: Dartagnan: bounded model checking for weak memory models (Competition contribution). In: TACAS 2020. LNCS, vol. 12079, pp. 378\u2013382. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45237-7_24"},{"key":"1_CR22","unstructured":"Microsoft: documentation of the System.Threading.Thread class (2023). https:\/\/learn.microsoft.com\/en-us\/dotnet\/api\/system.threading.thread, Accessed 01 Feb 2023"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-662-46681-0_45","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"TL Nguyen","year":"2015","unstructured":"Nguyen, T.L., Fischer, B., La Torre, S., Parlato, G.: Unbounded lazy-CSeq: a lazy sequentialization tool for C programs with unbounded context switches. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 461\u2013463. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_45"},{"key":"1_CR24","unstructured":"Oracle: Documentation of the java.lang.Thread class (2022). https:\/\/docs.oracle.com\/en\/java\/javase\/19\/docs\/api\/java.base\/java\/lang\/Thread.html, Accessed 01 Feb 2023"},{"issue":"5","key":"1_CR25","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/360051.360224","volume":"19","author":"SS Owicki","year":"1976","unstructured":"Owicki, S.S., Gries, D.: Verifying properties of parallel programs: an axiomatic approach. Commun. ACM 19(5), 279\u2013285 (1976). https:\/\/doi.org\/10.1145\/360051.360224","journal-title":"Commun. ACM"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Qadeer, S., Wu, D.: KISS: keep it simple and sequential. In: PLDI, pp. 14\u201324. ACM (2004). https:\/\/doi.org\/10.1145\/996841.996845","DOI":"10.1145\/996841.996845"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-030-72013-1_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Saan","year":"2021","unstructured":"Saan, S., et al.: Goblint: thread-modular abstract interpretation using side-effecting constraints. In: TACAS 2021. LNCS, vol. 12652, pp. 438\u2013442. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72013-1_28"},{"key":"1_CR28","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: Wies, T. (eds.) Programming Languages and Systems. ESOP 2023. LNCS, vol. 13990, pp. 28\u201358. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30044-8_2","DOI":"10.1007\/978-3-031-30044-8_2"},{"key":"1_CR29","unstructured":"The Ultimate team: Ultimate program analysis framework (2023). https:\/\/ultimate-pa.org\/, Accessed 24 Aug 2023"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Yang, Q., Li, M.: A cut-off approach for bounded verification of parameterized systems. In: ICSE (1), pp. 345\u2013354. ACM (2010). https:\/\/doi.org\/10.1145\/1806799.1806851","DOI":"10.1145\/1806799.1806851"}],"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-031-50521-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T00:07:24Z","timestamp":1704240444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50521-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"ISBN":["9783031505201","9783031505218"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50521-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,30]]},"assertion":[{"value":"30 December 2023","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":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"15 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl24.sigplan.org\/home\/VMCAI-2024","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":"74","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":"30","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":"0","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":"41% - 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":"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)"}}]}}