{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:01:17Z","timestamp":1781193677495,"version":"3.54.1"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032280787","type":"print"},{"value":"9783032280794","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-28079-4_10","type":"book-chapter","created":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T15:31:47Z","timestamp":1781191907000},"page":"217-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bit-Vector CHC Solving for\u00a0Binary Analysis and\u00a0Binary Analysis for\u00a0Bit-Vector CHC Solving"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3677-701X","authenticated-orcid":false,"given":"Aaron","family":"Bembenek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8271-0289","authenticated-orcid":false,"given":"Toby","family":"Murray","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,12]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Alt, L., Blicha, M., Hyv\u00e4rinen, A.E.J., Sharygina, N.: SolCMC: solidity compiler\u2019s model checker. In: International Conference on Computer Aided Verification, pp. 325\u2013338 (2022). https:\/\/doi.org\/10.1007\/978-3-031-13185-1_16","DOI":"10.1007\/978-3-031-13185-1_16"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Balakrishnan, G., Reps, T.W.: WYSINWYX: what you see is not what you execute. ACM Trans. Program. Lang. Syst. 32(6), 23:1\u201323:84 (2010)","DOI":"10.1145\/1749608.1749612"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11804192_17","volume-title":"Formal Methods for Components and Objects","author":"M Barnett","year":"2006","unstructured":"Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., Leino, K.R.M.: Boogie: a modular reusable verifier for object-oriented programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 364\u2013387. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11804192_17"},{"key":"10_CR4","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016). www.SMT-LIB.org"},{"key":"10_CR5","unstructured":"Barth, M., Heizmann, M.: A Bit-vector to Integer Translation with bv2nat and nat2bv. In: Int. Workshop Satisfiability Modulo Theories, pp. 53\u201363 (2024)"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Bembenek, A., Murray, T.: Bit-Vector CHC Solving for Binary Analysis and Binary Analysis for Bit-Vector CHC Solving (2026). https:\/\/doi.org\/10.6084\/m9.figshare.30983329","DOI":"10.6084\/m9.figshare.30983329"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Beyer, D., Strejcek, J.: Improvements in software verification and witness validation: SV-COMP 2025. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 151\u2013186 (2025). https:\/\/doi.org\/10.1007\/978-3-031-90660-2_9","DOI":"10.1007\/978-3-031-90660-2_9"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-23534-9_2","volume-title":"Fields of Logic and Computation II","author":"N Bj\u00f8rner","year":"2015","unstructured":"Bj\u00f8rner, N., Gurfinkel, A., McMillan, K., Rybalchenko, A.: Horn clause solvers for program verification. In: Beklemishev, L.D., Blass, A., Dershowitz, N., Finkbeiner, B., Schulte, W. (eds.) Fields of Logic and Computation II. LNCS, vol. 9300, pp. 24\u201351. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23534-9_2"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Bj\u00f8rner, N.S., McMillan, K.L., Rybalchenko, A.: Program verification as satisfiability modulo theories. In: International Workshop on Satisfiability Modulo Theories, pp. 3\u201311 (2012). https:\/\/doi.org\/10.29007\/1L7F","DOI":"10.29007\/1L7F"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Blicha, M., Britikov, K., Sharygina, N.: The golem horn solver. In: International Conference on Computer Aided Verification, pp. 209\u2013223 (2023). https:\/\/doi.org\/10.1007\/978-3-031-37703-7_10","DOI":"10.1007\/978-3-031-37703-7_10"},{"key":"10_CR11","unstructured":"Bobot, F., Deharb\u00e9, D., Jon\u00e1\u0161, M., Winterer, D.: 20th International Satisfiability Modulo Theories Competition (SMT-COMP 2025): Rules and Procedures. Technical report, SMT-COMP (2025). https:\/\/smt-comp.github.io\/2025\/rules.pdf. Accesed 18 Feb 2025"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Brumley, D., Jager, I., Avgerinos, T., Schwartz, E.J.: BAP: a binary analysis platform. In: International Conference on Computer Aided Verification, pp. 463\u2013469 (2011)","DOI":"10.1007\/978-3-642-22110-1_37"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"De Angelis, E., K., H.G.V.: CHC-COMP 2023: competition report. In: Workshop Horn Clauses for Verification and Synthesis, pp. 83\u2013104 (2023). https:\/\/doi.org\/10.4204\/EPTCS.402.10","DOI":"10.4204\/EPTCS.402.10"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Djoudi, A., Bardin, S.: BINSEC: binary code analysis with low-level regions. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 212\u2013217 (2015)","DOI":"10.1007\/978-3-662-46681-0_17"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"D\u2019Silva, V., Payer, M., Song, D.X.: The correctness-security gap in compiler optimization. In: IEEE Symposium on Security and Privacy Workshops, pp. 73\u201387 (2015). https:\/\/doi.org\/10.1109\/SPW.2015.33","DOI":"10.1109\/SPW.2015.33"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Ernst, G.: Korn\u2014Software verification with horn clauses (competition contribution). In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 559\u2013564 (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_36","DOI":"10.1007\/978-3-031-30820-8_36"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Ezudheen, P., Neider, D., D\u2019Souza, D., Garg, P., Madhusudan, P.: Horn-ICE learning for synthesizing invariants and contracts. Proc. ACM Program. Lang. 2(OOPSLA), 131:1\u2013131:25 (2018).https:\/\/doi.org\/10.1145\/3276501","DOI":"10.1145\/3276501"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Fedyukovich, G., Prabhu, S., Madhukar, K., Gupta, A.: Solving constrained horn clauses using syntax and data. In: International Conference on Formal Methods in Computer Aided Design, pp. 1\u20139 (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8603011","DOI":"10.23919\/FMCAD.2018.8603011"},{"key":"10_CR19","unstructured":"Flores-Montoya, A., Schulte, E.M.: Datalog disassembly. In: USENIX Security Symposium, pp. 1075\u20131092 (2020). https:\/\/www.usenix.org\/conference\/usenixsecurity20\/presentation\/flores-montoya"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Fortuna, C., et al.: CBAT: a comparative binary analysis tool. In: Binary Analysis Research Workshop, pp. 1\u20137 (2024). https:\/\/doi.org\/10.14722\/bar.2024.23009","DOI":"10.14722\/bar.2024.23009"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Garg, P., Neider, D., Madhusudan, P., Roth, D.: Learning invariants using decision trees and implication counterexamples. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 499\u2013512 (2016). https:\/\/doi.org\/10.1145\/2837614.2837664","DOI":"10.1145\/2837614.2837664"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: ACM SIGPLAN Conf. Programming Language Design and Implementation, pp. 405\u2013416 (2012). https:\/\/doi.org\/10.1145\/2254064.2254112","DOI":"10.1145\/2254064.2254112"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Gurfinkel, A.: Program verification with constrained horn clauses (invited paper). In: International Conference on Computer Aided Verification, pp. 19\u201329 (2022). https:\/\/doi.org\/10.1007\/978-3-031-13185-1_2","DOI":"10.1007\/978-3-031-13185-1_2"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-319-21690-4_20","volume-title":"Computer Aided Verification","author":"A Gurfinkel","year":"2015","unstructured":"Gurfinkel, A., Kahsai, T., Komuravelli, A., Navas, J.A.: The SeaHorn verification framework. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 343\u2013361. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_20"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-319-71237-6_26","volume-title":"Programming Languages and Systems","author":"S He","year":"2017","unstructured":"He, S., Rakamari\u0107, Z.: Counterexample-Guided bit-precision selection. In: Chang, B.-Y.E. (ed.) APLAS 2017. LNCS, vol. 10695, pp. 534\u2013553. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71237-6_26"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-39799-8_2","volume-title":"Computer Aided Verification","author":"M Heizmann","year":"2013","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Software model checking for people who love automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 36\u201352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_2"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-31612-8_13","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"K Hoder","year":"2012","unstructured":"Hoder, K., Bj\u00f8rner, N.: Generalized property directed reachability. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 157\u2013171. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_13"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Hojjat, H., R\u00fcmmer, P.: The ELDARICA horn solver. In: International Conference on Formal Methods in Computer Aided Design, pp. 1\u20137 (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8603013","DOI":"10.23919\/FMCAD.2018.8603013"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-319-41528-4_19","volume-title":"Computer Aided Verification","author":"T Kahsai","year":"2016","unstructured":"Kahsai, T., R\u00fcmmer, P., Sanchez, H., Sch\u00e4f, M.: JayHorn: a framework for verifying java programs. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 352\u2013358. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_19"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Kamath, A., et al.: Leveraging LLMs for Program Verification. In: International Conference on Formal Methods in Computer-Aided Design, pp. 107\u2013118 (2024). https:\/\/doi.org\/10.34727\/2024\/isbn.978-3-85448-065-5_16","DOI":"10.34727\/2024\/isbn.978-3-85448-065-5_16"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Kim, S., et al.: Testing intermediate representations for binary analysis. In: IEEE\/ACM International Conference on Automated Software Engineering, pp. 353\u2013364 (2017)","DOI":"10.1109\/ASE.2017.8115648"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Kinder, J., Veith, H.: Jakstab: A static analysis platform for binaries. In: International Conference on Computer Aided Verification, pp. 423\u2013427 (2008)","DOI":"10.1007\/978-3-540-70545-1_40"},{"issue":"3","key":"10_CR33","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00165-014-0326-7","volume":"27","author":"F Kirchner","year":"2015","unstructured":"Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., Yakobowski, B.: Frama-C: a software analysis perspective. Formal Aspects Comput. 27(3), 573\u2013609 (2015). https:\/\/doi.org\/10.1007\/s00165-014-0326-7","journal-title":"Formal Aspects Comput."},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-08867-9_2","volume-title":"Computer Aided Verification","author":"A Komuravelli","year":"2014","unstructured":"Komuravelli, A., Gurfinkel, A., Chaki, S.: SMT-Based model checking for recursive programs. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 17\u201334. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_2"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1007\/978-3-642-39799-8_59","volume-title":"Computer Aided Verification","author":"A Komuravelli","year":"2013","unstructured":"Komuravelli, A., Gurfinkel, A., Chaki, S., Clarke, E.M.: Automatic abstraction in SMT-Based unbounded software model checking. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 846\u2013862. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_59"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Lal, A., Qadeer, S.: Powering the static driver verifier using corral. In: ACM SIGSOFT International Symposium on Foundations of Software Engineering, pp. 202\u2013212 (2014). https:\/\/doi.org\/10.1145\/2635868.2635894","DOI":"10.1145\/2635868.2635894"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Lam, K., Coughlin, N.: Lift-off: trustworthy ARMv8 semantics from formal specifications. In: International Conference on Formal Methods in Computer-Aided Design, pp. 274\u2013283 (2023). https:\/\/doi.org\/10.34727\/2023\/ISBN.978-3-85448-060-0_36","DOI":"10.34727\/2023\/ISBN.978-3-85448-060-0_36"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-030-89051-3_16","volume-title":"Programming Languages and Systems","author":"YC Liu","year":"2021","unstructured":"Liu, Y.C., et al.: Proving LTL properties of BitVector programs and decompiled binaries. In: Oh, H. (ed.) APLAS 2021. LNCS, vol. 13008, pp. 285\u2013304. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89051-3_16"},{"key":"10_CR39","doi-asserted-by":"publisher","unstructured":"Matsushita, Y., Tsukada, T., Kobayashi, N.: RustHorn: CHC-based verification for rust programs. ACM Trans. Program. Lang. Syst. 43(4), 15:1\u201315:54 (2021). https:\/\/doi.org\/10.1145\/3462205","DOI":"10.1145\/3462205"},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"10_CR41","unstructured":"National Security Agency: Gidhra (2019). https:\/\/www.nsa.gov\/resources\/everyone\/ghidra"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding random SAT: beyond the clauses-to-variables ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 438\u2013452. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_33"},{"key":"10_CR43","doi-asserted-by":"publisher","unstructured":"Padhi, S., Sharma, R., Millstein, T.D.: Data-Driven precondition inference with learned features. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 42\u201356 (2016).https:\/\/doi.org\/10.1145\/2908080.2908099","DOI":"10.1145\/2908080.2908099"},{"key":"10_CR44","doi-asserted-by":"publisher","unstructured":"Pirzada, M.A.A., Reger, G., Bhayat, A., Cordeiro, L.C.: LLM-Generated invariants for bounded model checking without loop unrolling. In: IEEE\/ACM International Conference on Automated Software Engineering, pp. 1395\u20131407 (2024). https:\/\/doi.org\/10.1145\/3691620.3695512","DOI":"10.1145\/3691620.3695512"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Recoules, F., Bardin, S., Bonichon, R., Mounier, L., Potet, M.L.: Get rid of inline assembly through verification-oriented lifting. In: International Conference on Automated Software Engineering, pp. 577\u2013589 (2019)","DOI":"10.1109\/ASE.2019.00060"},{"key":"10_CR46","doi-asserted-by":"publisher","unstructured":"Schulte, E.M., Dorn, J., Flores-Montoya, A., Ballman, A., Johnson, T.: GTIRB: Intermediate Representation for Binaries. CoRR abs\/1907.02859 (2019). https:\/\/doi.org\/10.48550\/arxiv.1907.02859","DOI":"10.48550\/arxiv.1907.02859"},{"key":"10_CR47","doi-asserted-by":"publisher","unstructured":"Sch\u00fcssele, F., et al.: Ultimate automizer and the abstraction of bitwise operations - (competition contribution). In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 418\u2013423 (2024). https:\/\/doi.org\/10.1007\/978-3-031-57256-2_31","DOI":"10.1007\/978-3-031-57256-2_31"},{"issue":"2","key":"10_CR48","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/S10009-023-00696-0","volume":"25","author":"J Scott","year":"2023","unstructured":"Scott, J., Niemetz, A., Preiner, M., Nejati, S., Ganesh, V.: Algorithm selection for SMT. Int. J. Softw. Tools Technol. Transf. 25(2), 219\u2013239 (2023). https:\/\/doi.org\/10.1007\/S10009-023-00696-0","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10_CR49","doi-asserted-by":"publisher","unstructured":"Shoshitaishvili, Y., et al.: SOK: (State of) the art of war: offensive techniques in binary analysis. In: IEEE Symposium on Security and Privacy, pp. 138\u2013157 (2016). https:\/\/doi.org\/10.1109\/SP.2016.17","DOI":"10.1109\/SP.2016.17"},{"key":"10_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-53291-8_9","volume-title":"Computer Aided Verification","author":"X Si","year":"2020","unstructured":"Si, X., Naik, A., Dai, H., Naik, M., Song, L.: Code2Inv: a deep learning framework for program verification. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 151\u2013164. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_9"},{"key":"10_CR51","doi-asserted-by":"publisher","unstructured":"Smith-Miles, K., Mu\u00f1oz, M.A.: Instance space analysis for algorithm testing: methodology and software tools. ACM Comput. Surv. 55(12), 255:1\u2013255:31 (2023). https:\/\/doi.org\/10.1145\/3572895","DOI":"10.1145\/3572895"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Tork, S.B., Coughlin, N., Michael, A., Tobler, J., Winter, K.: Data structure analysis for binaries. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems (2026). to appear","DOI":"10.1007\/978-3-032-22749-2_12"},{"key":"10_CR53","doi-asserted-by":"publisher","unstructured":"T\u00f3th, T., Hajdu, \u00c1., V\u00f6r\u00f6s, A., Micskei, Z., Majzik, I.: Theta: a framework for abstraction refinement-based model checking. In: International Conference on Formal Methods in Computer Aided Design, pp. 176\u2013179 (2017). https:\/\/doi.org\/10.23919\/FMCAD.2017.8102257","DOI":"10.23919\/FMCAD.2017.8102257"},{"key":"10_CR54","unstructured":"Trail of Bits: Lifting-bits\/McSema: Framework for lifting X86, AMD64, aarch64, Sparc32, and Sparc64 program binaries to LLVM bitcode (2022). https:\/\/github.com\/lifting-bits\/mcsema"},{"key":"10_CR55","unstructured":"UQ-PAC: BASIL (Boogie Analysis for Secure Information-Flow Logics). https:\/\/github.com\/UQ-PAC\/BASIL. Accessed 08 Dec 2025"},{"key":"10_CR56","unstructured":"UQ-PAC: gtirb-semantics. https:\/\/github.com\/UQ-PAC\/gtirb-semantics. Accessed 08 Dec 2025"},{"key":"10_CR57","doi-asserted-by":"publisher","unstructured":"Wu, G., et al.: LLM meets bounded model checking: neuro-symbolic loop invariant inference. In: IEEE\/ACM International Conference on Automated Software Engineering, pp. 406\u2013417 (2024). https:\/\/doi.org\/10.1145\/3691620.3695014","DOI":"10.1145\/3691620.3695014"},{"key":"10_CR58","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/JAIR.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008). https:\/\/doi.org\/10.1613\/JAIR.2490","journal-title":"J. Artif. Intell. Res."},{"key":"10_CR59","doi-asserted-by":"publisher","unstructured":"Zhu, H., Magill, S., Jagannathan, S.: A data-driven CHC solver. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 707\u2013721 (2018). https:\/\/doi.org\/10.1145\/3192366.3192416","DOI":"10.1145\/3192366.3192416"},{"key":"10_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-030-94583-1_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"Y Zohar","year":"2022","unstructured":"Zohar, Y., et al.: Bit-Precise reasoning via Int-Blasting. In: Finkbeiner, B., Wies, T. (eds.) VMCAI 2022. LNCS, vol. 13182, pp. 496\u2013518. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94583-1_24"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28079-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T15:31:52Z","timestamp":1781191912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28079-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032280787","9783032280794"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28079-4_10","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":"12 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"5 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nfm2026.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}