{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:21:16Z","timestamp":1779074476856,"version":"3.51.4"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031377020","type":"print"},{"value":"9783031377037","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"vor","delay-in-days":198,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The logical framework of Constrained Horn Clauses (CHC) models verification tasks from a variety of domains, ranging from verification of safety properties in transition systems to modular verification of programs with procedures. In this work we present <jats:sc>Golem<\/jats:sc>, a flexible and efficient solver for satisfiability of CHC over linear real and integer arithmetic. <jats:sc>Golem<\/jats:sc> provides flexibility with modular architecture and multiple back-end model-checking algorithms, as well as efficiency with tight integration with the underlying SMT solver. This paper describes the architecture of <jats:sc>Golem<\/jats:sc> and its back-end engines, which include our recently introduced model-checking algorithm TPA for deep exploration. The description is complemented by extensive evaluation, demonstrating the competitive nature of the solver.<\/jats:p>","DOI":"10.1007\/978-3-031-37703-7_10","type":"book-chapter","created":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T17:02:15Z","timestamp":1689613335000},"page":"209-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The Golem Horn Solver"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8140-4098","authenticated-orcid":false,"given":"Martin","family":"Blicha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7843-7290","authenticated-orcid":false,"given":"Konstantin","family":"Britikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8872-4913","authenticated-orcid":false,"given":"Natasha","family":"Sharygina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,18]]},"reference":[{"key":"10_CR1","unstructured":"Alt, L.: Controlled and Effective Interpolation. Ph.D. thesis, Universit\u00e0 della Svizzera italiana (2016). https:\/\/susi.usi.ch\/usi\/documents\/318933"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-031-13185-1_16","volume-title":"Computer Aided Verification","author":"L Alt","year":"2022","unstructured":"Alt, L., Blicha, M., Hyv\u00e4rinen, A.E.J., Sharygina, N.: SolCMC: Solidity compiler\u2019s model checker. In: Shoham, S., Vizel, Y. (eds.) Computer Aided Verification, pp. 325\u2013338. Springer International Publishing, Cham (2022)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-70389-3_13","volume-title":"Hardware and Software: Verification and Testing","author":"L Alt","year":"2017","unstructured":"Alt, L., Hyv\u00e4rinen, A.E.J., Sharygina, N.: LRA interpolants from no man\u2019s land. In: Strichman, O., Tzoref-Brill, R. (eds.) Hardware and Software: Verification and Testing, pp. 195\u2013210. Springer International Publishing, Cham (2017)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Syntax-guided synthesis. In: 2013 Formal Methods in Computer-Aided Design, pp. 1\u20138 (2013)","DOI":"10.1109\/FMCAD.2013.6679385"},{"key":"10_CR5","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Tech. rep., Department of Computer Science, The University of Iowa (2017). https:\/\/www.SMT-LIB.org"},{"key":"10_CR6","unstructured":"Beyer, D., Wendler, P.: Algorithms for software model checking: Predicate abstraction vs. Impact. In: 2012 Formal Methods in Computer-Aided Design (FMCAD), pp. 106\u2013113 (Oct 2012)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-45190-5_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Beyer","year":"2020","unstructured":"Beyer, D., Dangl, M.: Software verification with PDR: an implementation of the state of the art. In: Biere, A., Parker, D. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 3\u201321. Springer International Publishing, Cham (2020)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-319-21690-4_42","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2015","unstructured":"Beyer, D., Dangl, M., Wendler, P.: Boosting k-induction with continuously-refined invariants. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) Computer Aided Verification, pp. 622\u2013640. Springer International Publishing, Cham (2015)"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10817-017-9432-6","volume":"60","author":"D Beyer","year":"2018","unstructured":"Beyer, D., Dangl, M., Wendler, P.: A unifying view on SMT-based software verification. J. Autom. Reason. 60(3), 299\u2013335 (2018)","journal-title":"J. Autom. Reason."},{"key":"10_CR10","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.) Computer Aided Verification, pp. 184\u2013190. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)"},{"key":"10_CR11","unstructured":"Beyer, D., Lee, N.Z., Wendler, P.: Interpolation and SAT-based model checking revisited: Adoption to software verification. Tech. Rep. arXiv\/CoRR arXiv:2208.05046 (August 2022)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 193\u2013207. Springer, Berlin Heidelberg, Berlin, Heidelberg (1999)"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Blicha, M., Fedyukovich, G., Hyv\u00e4rinen, A.E.J., Sharygina, N.: Split transition power abstractions for unbounded safety. In: Griggio, A., Rungta, N. (eds.) Proceedings of the 22nd Conference on Formal Methods in Computer-Aided Design - FMCAD 2022. pp. 349\u2013358. TU Wien Academic Press (2022). https:\/\/doi.org\/10.34727\/2022\/isbn.978-3-85448-053-2_42","DOI":"10.34727\/2022\/isbn.978-3-85448-053-2_42"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-030-99524-9_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Blicha","year":"2022","unstructured":"Blicha, M., Fedyukovich, G., Hyv\u00e4rinen, A.E.J., Sharygina, N.: Transition power abstractions for deep counterexample detection. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 524\u2013542. Springer International Publishing, Cham (2022)"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10009-021-00641-z","volume":"24","author":"M Blicha","year":"2022","unstructured":"Blicha, M., Hyv\u00e4rinen, A.E.J., Kofro\u0148, J., Sharygina, N.: Using linear algebra in decomposition of Farkas interpolants. Int. J. Softw. Tools Technol. Transfer 24(1), 111\u2013125 (2022)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-18275-4_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AR Bradley","year":"2011","unstructured":"Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D. (eds.) Verification, Model Checking, and Abstract Interpretation, pp. 70\u201387. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-12002-2_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Bruttomesso","year":"2010","unstructured":"Bruttomesso, R., Pek, E., Sharygina, N., Tsitovich, A.: The OpenSMT solver. In: Esparza, J., Majumdar, R. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 150\u2013153. Springer, Berlin Heidelberg, Berlin, Heidelberg (2010)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Calzavara, S., Grishchenko, I., Maffei, M.: HornDroid: Practical and sound static analysis of android applications by SMT solving. In: 2016 IEEE European Symposium on Security and Privacy, pp. 47\u201362 (2016)","DOI":"10.1109\/EuroSP.2016.16"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-319-89960-2_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Champion","year":"2018","unstructured":"Champion, A., Chiba, T., Kobayashi, N., Sato, R.: ICE-based refinement type discovery for higher-order functional programs. In: Beyer, D., Huisman, M. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 365\u2013384. Springer International Publishing, Cham (2018)"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-030-02768-1_8","volume-title":"Programming Languages and Systems","author":"A Champion","year":"2018","unstructured":"Champion, A., Kobayashi, N., Sato, R.: HoIce: an ICE-based non-linear Horn clause solver. In: Ryu, S. (ed.) Programming Languages and Systems, pp. 146\u2013156. Springer International Publishing, Cham (2018)"},{"key":"10_CR21","unstructured":"Cimatti, A., Griggio, A., Tonetta, S.: The VMT-LIB language and tools (2021)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) Computer Aided Verification, pp. 154\u2013169. Springer, Berlin Heidelberg, Berlin, Heidelberg (2000)"},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"269","DOI":"10.2307\/2963594","volume":"22","author":"W Craig","year":"1957","unstructured":"Craig, W.: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symbolic Logic 22(3), 269\u2013285 (1957)","journal-title":"J. Symbolic Logic"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"De Angelis, E., Vediramana Krishnan, H.G.: CHC-COMP 2022: Competition report. Electron. Proc. Theor. Comput. Sci. 373, 44\u201362 (nov 2022)","DOI":"10.4204\/EPTCS.373.5"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Dietsch, D., Heizmann, M., Hoenicke, J., Nutz, A., Podelski, A.: Ultimate TreeAutomizer (CHC-COMP tool description). In: Angelis, E.D., Fedyukovich, G., Tzevelekos, N., Ulbrich, M. (eds.) Proceedings of the Sixth Workshop on Horn Clauses for Verification and Synthesis and Third Workshop on Program Equivalence and Relational Reasoning, HCVS\/PERR@ETAPS 2019, Prague, Czech Republic, 6\u20137th April 2019. EPTCS, vol. 296, pp. 42\u201347 (2019)","DOI":"10.4204\/EPTCS.296.7"},{"key":"10_CR26","unstructured":"Een, N., Mishchenko, A., Brayton, R.: Efficient implementation of property directed reachability. In: Proceedings of the International Conference on Formal Methods in Computer-Aided Design, pp. 125\u2013134. FMCAD \u201911, FMCAD Inc, Austin, TX (2011)"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-031-30820-8_36","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Ernst","year":"2023","unstructured":"Ernst, G.: Korn\u2013software verification with Horn clauses (competition contribution). In: Sankaranarayanan, S., Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 559\u2013564. Springer Nature Switzerland, Cham (2023)"},{"key":"10_CR28","unstructured":"Esen, Z., R\u00fcmmer, P.: TriCera: Verifying C programs using the theory of heaps. In: Griggio, A., Rungta, N. (eds.) Proceedings of the 22nd Conference on Formal Methods in Computer-Aided Design - FMCAD 2022, pp. 360\u2013391. TU Wien Academic Press (2022)"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Fedyukovich, G., Kaufman, S.J., Bod\u00edk, R.: Sampling invariants from frequency distributions. In: 2017 Formal Methods in Computer Aided Design (FMCAD), pp. 100\u2013107 (2017)","DOI":"10.23919\/FMCAD.2017.8102247"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Fedyukovich, G., Prabhu, S., Madhukar, K., Gupta, A.: Solving constrained Horn clauses using syntax and data. In: 2018 Formal Methods in Computer Aided Design (FMCAD), pp. 1\u20139 (2018)","DOI":"10.23919\/FMCAD.2018.8603011"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Fedyukovich, G., R\u00fcmmer, P.: Competition report: CHC-COMP-21. In: Hojjat, H., Kafle, B. (eds.) Proceedings 8th Workshop on Horn Clauses for Verification and Synthesis, HCVS@ETAPS 2021, Virtual, 28th March 2021. EPTCS, vol. 344, pp. 91\u2013108 (2021)","DOI":"10.4204\/EPTCS.344.7"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72\u201383. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63166-6_10"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 405\u2013416. PLDI \u201912, Association for Computing Machinery, New York, NY, USA (2012)","DOI":"10.1145\/2254064.2254112"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Gurfinkel, A., Bj\u00f8rner, N.: The science, art, and magic of constrained Horn clauses. In: 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 6\u201310 (2019)","DOI":"10.1109\/SYNASC49474.2019.00010"},{"key":"10_CR35","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-031-13185-1_2","volume-title":"Computer Aided Verification","author":"A Gurfinkel","year":"2022","unstructured":"Gurfinkel, A.: Program verification with constrained Horn clauses (invited paper). In: Shoham, S., Vizel, Y. (eds.) Computer Aided Verification, pp. 19\u201329. Springer International Publishing, Cham (2022)"},{"key":"10_CR36","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.) Computer Aided Verification, pp. 343\u2013361. Springer International Publishing, Cham (2015)"},{"key":"10_CR37","first-page":"101","volume-title":"Computer Aided Verification","author":"VK Hari Govind","year":"2020","unstructured":"Hari Govind, V.K., Chen, Y., Shoham, S., Gurfinkel, A.: Global guidance for local generalization in model checking. In: Lahiri, S.K., Wang, C. (eds.) Computer Aided Verification, pp. 101\u2013125. Springer International Publishing, Cham (2020)"},{"key":"10_CR38","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_CR39","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-33386-6_16","volume-title":"Automated Technology for Verification and Analysis","author":"H Hojjat","year":"2012","unstructured":"Hojjat, H., Iosif, R., Kone\u010dn\u00fd, F., Kuncak, V., R\u00fcmmer, P.: Accelerating interpolants. In: Chakraborty, S., Mukund, M. (eds.) Automated Technology for Verification and Analysis, pp. 187\u2013202. Springer, Berlin Heidelberg, Berlin, Heidelberg (2012)"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Hojjat, H., R\u00fcmmer, P.: The Eldarica Horn solver. In: FMCAD, pp. 158\u2013164. IEEE (10 2018)","DOI":"10.23919\/FMCAD.2018.8603013"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Hojjat, H., R\u00fcmmer, P., Subotic, P., Yi, W.: Horn clauses for communicating timed systems. Electronic Proceedings in Theoretical Computer Science 169, 39\u201352 (dec 2014)","DOI":"10.4204\/EPTCS.169.6"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-319-40970-2_35","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"AEJ Hyv\u00e4rinen","year":"2016","unstructured":"Hyv\u00e4rinen, A.E.J., Marescotti, M., Alt, L., Sharygina, N.: OpenSMT2: An SMT Solver for Multi-core and Cloud Computing. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 547\u2013553. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_35"},{"key":"10_CR43","first-page":"209","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B Kafle","year":"2015","unstructured":"Kafle, B., Gallagher, J.P.: Tree automata-based refinement with application to Horn clause verification. In: D\u2019Souza, D., Lal, A., Larsen, K.G. (eds.) Verification, Model Checking, and Abstract Interpretation, pp. 209\u2013226. Springer, Berlin Heidelberg, Berlin, Heidelberg (2015)"},{"key":"10_CR44","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.) Computer Aided Verification, pp. 352\u2013358. Springer International Publishing, Cham (2016)"},{"issue":"3","key":"10_CR45","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-016-0249-4","volume":"48","author":"A Komuravelli","year":"2016","unstructured":"Komuravelli, A., Gurfinkel, A., Chaki, S.: SMT-based model checking for recursive programs. Formal Methods in System Design 48(3), 175\u2013205 (2016)","journal-title":"Formal Methods in System Design"},{"issue":"4","key":"10_CR46","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00236-015-0236-z","volume":"53","author":"J Leroux","year":"2016","unstructured":"Leroux, J., R\u00fcmmer, P., Suboti\u0107, P.: Guiding Craig interpolation with domain-specific abstractions. Acta Informatica 53(4), 387\u2013424 (2016)","journal-title":"Acta Informatica"},{"key":"10_CR47","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-030-81688-9_22","volume-title":"Computer Aided Verification","author":"M Mann","year":"2021","unstructured":"Mann, M., et al.: Pono: a flexible and extensible SMT-based model checker. In: Silva, A., Leino, K.R.M. (eds.) Computer Aided Verification, pp. 461\u2013474. Springer International Publishing, Cham (2021)"},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Matsushita, Y., Tsukada, T., Kobayashi, N.: RustHorn: CHC-based verification for Rust programs. ACM Trans. Program. Lang. Syst. 43(4) (oct 2021)","DOI":"10.1145\/3462205"},{"key":"10_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-Based model checking. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1\u201313. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_1"},{"key":"10_CR50","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/11817963_14","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2006","unstructured":"McMillan, K.L.: Lazy abstraction with interpolants. In: Ball, T., Jones, R.B. (eds.) Computer Aided Verification, pp. 123\u2013136. Springer, Berlin Heidelberg, Berlin, Heidelberg (2006)"},{"key":"10_CR51","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.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 337\u2013340. Springer, Berlin Heidelberg, Berlin, Heidelberg (2008)"},{"key":"10_CR52","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-642-45221-5_45","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"SF Rollini","year":"2013","unstructured":"Rollini, S.F., Alt, L., Fedyukovich, G., Hyv\u00e4rinen, A.E.J., Sharygina, N.: PeRIPLO: a framework for producing effective interpolants in SAT-based software verification. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning, pp. 683\u2013693. Springer, Berlin Heidelberg, Berlin, Heidelberg (2013)"},{"key":"10_CR53","doi-asserted-by":"crossref","unstructured":"R\u00fcmmer, P., Suboti\u0107, P.: Exploring interpolants. In: 2013 Formal Methods in Computer-Aided Design, pp. 69\u201376 (Oct 2013)","DOI":"10.1109\/FMCAD.2013.6679393"},{"key":"10_CR54","doi-asserted-by":"publisher","first-page":"197","DOI":"10.4204\/EPTCS.320.15","volume":"320","author":"P R\u00fcmmer","year":"2020","unstructured":"R\u00fcmmer, P.: Competition report: CHC-COMP-20. Electron. Proc. Theor. Comput. Sci. 320, 197\u2013219 (2020)","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"10_CR55","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-40922-X_8","volume-title":"Formal Methods in Computer-Aided Design","author":"M Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking safety properties using induction and a SAT-solver. In: Hunt, W.A., Johnson, S.D. (eds.) Formal Methods in Computer-Aided Design, pp. 127\u2013144. Springer, Berlin Heidelberg, Berlin, Heidelberg (2000)"},{"key":"10_CR56","doi-asserted-by":"crossref","unstructured":"Wang, W., Jiao, L.: Trace Abstraction Refinement for Solving Horn Clauses. Comput. J.59(8), 1236\u20131251 (08 2016)","DOI":"10.1093\/comjnl\/bxw017"},{"key":"10_CR57","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-94583-1_21","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S Wesley","year":"2022","unstructured":"Wesley, S., Christakis, M., Navas, J.A., Trefler, R., W\u00fcstholz, V., Gurfinkel, A.: Verifying solidity smart contracts via communication abstraction in smartace. In: Finkbeiner, B., Wies, T. (eds.) Verification, Model Checking, and Abstract Interpretation, pp. 425\u2013449. Springer International Publishing, Cham (2022)"},{"key":"10_CR58","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-030-99527-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"I Zlatkin","year":"2022","unstructured":"Zlatkin, I., Fedyukovich, G.: Maximizing branch coverage with constrained Horn clauses. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 254\u2013272. Springer International Publishing, Cham (2022)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37703-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T11:03:58Z","timestamp":1693047838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37703-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377020","9783031377037"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37703-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i-cav.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"hotcrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"261","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":"67","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":"26% - 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":"11","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)"}}]}}