{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T23:22:59Z","timestamp":1762816979421,"version":"build-2065373602"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819542123"},{"type":"electronic","value":"9789819542130"}],"license":[{"start":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T00:00:00Z","timestamp":1762819200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T00:00:00Z","timestamp":1762819200000},"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-981-95-4213-0_3","type":"book-chapter","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T23:17:54Z","timestamp":1762816674000},"page":"42-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LLM-SYM: Integrating Symbolic Methods and\u00a0Large Language Models for\u00a0Automated Theorem Proving"],"prefix":"10.1007","author":[{"given":"Yifan","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanhong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianqi","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,11]]},"reference":[{"key":"3_CR1","unstructured":"Eprover (2024). http:\/\/www.eprover.org"},{"key":"3_CR2","unstructured":"Gpt-3.5-turbo (2024). https:\/\/platform.openai.com\/docs\/models\/gpt-3-5-turbo"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-99524-9_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Barbosa","year":"2022","unstructured":"Barbosa, H., et al.: cvc5: a versatile and industrial-strength SMT solver. In: TACAS 2022. LNCS, vol. 13243, pp. 415\u2013442. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bengio, Y., Louradour, J., Collobert, R., Weston, J.: Curriculum learning. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 41\u201348 (2009)","DOI":"10.1145\/1553374.1553380"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Chen, H., Wu, X., Shao, Z., Lockerman, J., Gu, R.: Toward compositional verification of interruptible os kernels and device drivers. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 431\u2013447 (2016)","DOI":"10.1145\/2908080.2908101"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Czajka, z., Kaliszyk, C.: Hammer for coq: automation for dependent type theory. J. Autom. Reason. 61(1\u20134), 423\u2013453 (2018). https:\/\/doi.org\/10.1007\/s10817-018-9458-4","DOI":"10.1007\/s10817-018-9458-4"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"First, E., Brun, Y.: Diversity-driven automated formal verification. In: Proceedings of the 44th International Conference on Software Engineering, pp. 749\u2013761 (2022)","DOI":"10.1145\/3510003.3510138"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"First, E., Brun, Y., Guha, A.: Tactok: semantics-aware proof synthesis. Proc. ACM Program. Lang. 4(OOPSLA), 1\u201331 (2020)","DOI":"10.1145\/3428299"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"First, E., Rabe, M., Ringer, T., Brun, Y.: Baldur: whole-proof generation and repair with large language models. In: Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, pp. 1229\u20131241 (2023)","DOI":"10.1145\/3611643.3616243"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.4249\/scholarpedia.1888","volume":"8","author":"S Grossberg","year":"2013","unstructured":"Grossberg, S.: Recurrent neural networks. Scholarpedia 8(2), 1888 (2013)","journal-title":"Scholarpedia"},{"issue":"2","key":"3_CR11","first-page":"3","volume":"1","author":"EJ Hu","year":"2022","unstructured":"Hu, E.J., et al.: Lora: low-rank adaptation of large language models. ICLR 1(2), 3 (2022)","journal-title":"ICLR"},{"key":"3_CR12","unstructured":"Hu, Y., et al.: Qualityflow: an agentic workflow for program synthesis controlled by llm quality checks. arXiv preprint arXiv:2501.17167 (2025)"},{"key":"3_CR13","unstructured":"Jiang, A.Q., et al.: Draft, sketch, and prove: guiding formal theorem provers with informal proofs. arXiv preprint arXiv:2210.12283 (2022)"},{"key":"3_CR14","unstructured":"Jiang, A.Q., Li, W., Han, J.M., Wu, Y.: Lisa: language models of isabelle proofs. In: 6th Conference on Artificial Intelligence and Theorem Proving, pp. 378\u2013392 (2021)"},{"key":"3_CR15","first-page":"8360","volume":"35","author":"AQ Jiang","year":"2022","unstructured":"Jiang, A.Q., et al.: Thor: wielding hammers to integrate language models and automated theorem provers. Adv. Neural. Inf. Process. Syst. 35, 8360\u20138373 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11786-014-0182-0","volume":"9","author":"C Kaliszyk","year":"2015","unstructured":"Kaliszyk, C., Urban, J.: Hol (y) hammer: online atp service for hol light. Math. Comput. Sci. 9, 5\u201322 (2015)","journal-title":"Math. Comput. Sci."},{"key":"3_CR17","unstructured":"K\u00e4stner, Det al.: CompCert: practical experience on integrating and qualifying a formally verified optimizing compiler. In: ERTS 2018: Embedded Real Time Software and Systems. SEE (2018). http:\/\/xavierleroy.org\/publi\/erts2018_compcert.pdf"},{"key":"3_CR18","unstructured":"Lewkowycz, A., et\u00a0al.: Solving quantitative reasoning problems with language models (2022). https:\/\/arxiv.org\/abs\/2206.14858"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Lu, M., Delaware, B., Zhang, T.: Proof automation with large language models. In: Proceedings of the 39th IEEE\/ACM International Conference on Automated Software Engineering, pp. 1509\u20131520 (2024)","DOI":"10.1145\/3691620.3695521"},{"key":"3_CR20","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":"3_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-319-21401-6_26","volume-title":"Automated Deduction - CADE-25","author":"L de Moura","year":"2015","unstructured":"de Moura, L., Kong, S., Avigad, J., van Doorn, F., von Raumer, J.: The lean theorem prover (system description). In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 378\u2013388. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_26"},{"key":"3_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","author":"T Nipkow","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C.: Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. Springer-Verlag, Heidelberg (2002)"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Paulson, L.C., Blanchette, J.C.: Three years of experience with sledgehammer, a practical link between automatic and interactive theorem provers. In: Sutcliffe, G., Schulz, S., Ternovska, E. (eds.) IWIL 2010. The 8th International Workshop on the Implementation of Logics. EPiC Series in Computing, vol.\u00a02, pp. 1\u201311. EasyChair (2012).https:\/\/doi.org\/10.29007\/36dt","DOI":"10.29007\/36dt"},{"key":"3_CR24","unstructured":"Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Commun. 15(2,3), 91\u2013110 (2002)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Russinoff, D.M.: Formal verification of floating-point hardware design. Springer, 10, 978\u20133 (2022)","DOI":"10.1007\/978-3-030-87181-9"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Sanchez-Stern, A., Alhessi, Y., Saul, L., Lerner, S.: Generating correctness proofs with neural networks. In: Proceedings of the 4th ACM SIGPLAN International Workshop on Machine Learning and Programming Languages, pp. 1\u201310 (2020)","DOI":"10.1145\/3394450.3397466"},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3593374","volume":"45","author":"A Sanchez-Stern","year":"2023","unstructured":"Sanchez-Stern, A., First, E., Zhou, T., Kaufman, Z., Brun, Y., Ringer, T.: Passport: improving automated formal verification using identifiers. ACM Trans. Program. Lang. Syst. 45(2), 1\u201330 (2023)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Tai, K.S., Socher, R., Manning, C.D.: Improved semantic representations from tree-structured long short-term memory networks. arXiv preprint arXiv:1503.00075 (2015)","DOI":"10.3115\/v1\/P15-1150"},{"key":"3_CR29","unstructured":"Thakur, A., Wen, Y., Chaudhuri, S.: A language-agent approach to formal theorem-proving. arXiv preprint arXiv:2310.04353 (2023)"},{"key":"3_CR30","unstructured":"The Coq Development Team: The Coq reference manual \u2013 release 8.19.0 (2024). https:\/\/coq.inria.fr\/doc\/V8.19.0\/refman"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Wang, R., et al.: Theoremllama: transforming general-purpose llms into lean4 experts. arXiv preprint arXiv:2407.03203 (2024)","DOI":"10.18653\/v1\/2024.emnlp-main.667"},{"key":"3_CR32","unstructured":"Yang, A., et\u00a0al.: Qwen2. 5 technical report. arXiv preprint arXiv:2412.15115 (2024)"},{"key":"3_CR33","unstructured":"Yang, K., Deng, J.: Learning to prove theorems via interacting with proof assistants. In: International Conference on Machine Learning, pp. 6984\u20136994. PMLR (2019)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4213-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T23:18:13Z","timestamp":1762816693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4213-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,11]]},"ISBN":["9789819542123","9789819542130"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4213-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,11,11]]},"assertion":[{"value":"11 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icfem2025.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}