{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T13:15:38Z","timestamp":1782911738640,"version":"3.54.5"},"publisher-location":"Cham","reference-count":14,"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]]},"DOI":"10.1007\/978-3-032-22749-2_32","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:12:59Z","timestamp":1776258779000},"page":"559-564","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Re3ver: Reverse and Verify"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4639-1673","authenticated-orcid":false,"given":"Ad\u00e9la","family":"\u0160t\u011bpkov\u00e1","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4703-0795","authenticated-orcid":false,"given":"Martin","family":"Jon\u00e1\u0161","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5873-403X","authenticated-orcid":false,"given":"Jan","family":"Strej\u010dek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","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). LNCS\u00a016506, Springer (2026)","DOI":"10.1007\/978-3-032-22749-2_23"},{"key":"32_CR2","unstructured":"Cadar, C., Dunbar, D., Engler, D.R.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In: Draves, R., van Renesse, R. (eds.) OSDI 2008. pp. 209\u2013224. USENIX Association (2008), http:\/\/www.usenix.org\/events\/osdi08\/tech\/full_papers\/cadar\/cadar.pdf"},{"key":"32_CR3","doi-asserted-by":"publisher","unstructured":"Chalupa, M., Strej\u010dek, J.: Backward symbolic execution with loop folding. In: Dragoi, C., Mukherjee, S., Namjoshi, K.S. (eds.) 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":"32_CR4","doi-asserted-by":"publisher","unstructured":"Chandra, S., Fink, S.J., Sridharan, M.: Snugglebug: a powerful approach to weakest preconditions. In: Hind, M., Diwan, A. (eds.) PLDI 2009. pp. 363\u2013374. ACM (2009). https:\/\/doi.org\/10.1145\/1542476.1542517","DOI":"10.1145\/1542476.1542517"},{"key":"32_CR5","doi-asserted-by":"publisher","unstructured":"Jon\u00e1\u0161, M., Kumor, K., Nov\u00e1k, J., Sedl\u00e1\u010dek, J., Trt\u00edk, M., Zaoral, L., Ayaziov\u00e1, P., Strej\u010dek, J.: Symbiotic 10: Lazy memory initialization and compact symbolic execution (competition contribution). In: Finkbeiner, B., Kov\u00e1cs, L. (eds.) TACAS 2024. LNCS, vol. 14572, pp. 406\u2013411. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57256-2_29","DOI":"10.1007\/978-3-031-57256-2_29"},{"key":"32_CR6","doi-asserted-by":"publisher","unstructured":"Jon\u00e1\u0161, M., Strej\u010dek, J., Griggio, A.: Combining symbolic execution with predicate abstraction and CEGAR. In: Narodytska, N., R\u00fcmmer, P. (eds.) FMCAD 2024. pp. 271\u2013280. IEEE (2024). https:\/\/doi.org\/10.34727\/2024\/ISBN.978-3-85448-065-5_33","DOI":"10.34727\/2024\/ISBN.978-3-85448-065-5_33"},{"key":"32_CR7","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":"32_CR8","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.S.: LLVM: A compilation framework for lifelong program analysis & transformation. In: CGO 2004. pp. 75\u201388. IEEE Computer Society (2004), https:\/\/doi.org\/10.1109\/CGO.2004.1281665","DOI":"10.1109\/CGO.2004.1281665"},{"key":"32_CR9","doi-asserted-by":"publisher","unstructured":"Li, J., Zhu, S., Zhang, Y., Pu, G., Vardi, M.Y.: Safety model checking with complementary approximations. In: Parameswaran, S. (ed.) ICCAD 2017. pp. 95\u2013100. IEEE (2017). https:\/\/doi.org\/10.1109\/ICCAD.2017.8203765","DOI":"10.1109\/ICCAD.2017.8203765"},{"key":"32_CR10","unstructured":"Mihalkovi\u010d, V., Jon\u00e1\u0161, M., Strej\u010dek, J.: llvm2c: Translation of LLVM IR to C for program analysis (2026), submitted to FM\u00a02026."},{"key":"32_CR11","unstructured":"Seufert, T., Scholl, C.: Sequential verification using reverse PDR. In: Gro\u00dfe, D., Drechsler, R. (eds.) MBMV 2017. pp. 79\u201390. Shaker Verlag (2017)"},{"key":"32_CR12","doi-asserted-by":"publisher","unstructured":"Slab\u00fd, J., Strej\u010dek, J., Trt\u00edk, M.: Compact symbolic execution. In: Hung, D.V., Ogawa, M. (eds.) ATVA 2013. LNCS, vol.\u00a08172, pp. 193\u2013207. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-319-02444-8_15","DOI":"10.1007\/978-3-319-02444-8_15"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"\u0160t\u011bpkov\u00e1, A.: Reversing Programs for Error Reachability Analysis. Master\u2019s thesis, Faculty of Informatics, Masaryk University, Brno (2025)","DOI":"10.1145\/3713081.3731743"},{"key":"32_CR14","doi-asserted-by":"publisher","unstructured":"\u0160t\u011bpkov\u00e1, A., Strej\u010dek, J., Jon\u00e1\u0161, M.: Re3ver: Submission to SVCOMP 2026 (Nov 2025). https:\/\/doi.org\/10.5281\/zenodo.17672678","DOI":"10.5281\/zenodo.17672678"}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:30:54Z","timestamp":1782865854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22749-2_32"}},"subtitle":["(Competition Contribution)"],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227485","9783032227492"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22749-2_32","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"}}]}}