{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:29:21Z","timestamp":1743100161930,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031424403"},{"type":"electronic","value":"9783031424410"}],"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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-42441-0_8","type":"book-chapter","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T16:05:28Z","timestamp":1693325128000},"page":"104-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Genetic Algorithm for\u00a0Program Synthesis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6693-5325","authenticated-orcid":false,"given":"Yutaka","family":"Nagashima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"key":"8_CR1","unstructured":"Fogel, L., Owens, A.J., Walsh, M.J.: Artificial intelligence through simulated evolution (1966)"},{"key":"8_CR2","first-page":"2171","volume":"13","author":"FA Fortin","year":"2012","unstructured":"Fortin, F.A., De Rainville, F.M., Gardner, M.A., Parizeau, M., Gagn\u00e9, C.: DEAP: evolutionary algorithms made easy. J. Mach. Learn. Res. 13, 2171\u20132175 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0031814","volume-title":"Formal Methods in Computer-Aided Design","author":"J Harrison","year":"1996","unstructured":"Harrison, J.: HOL light: a tutorial introduction. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 265\u2013269. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0031814"},{"key":"8_CR4","unstructured":"Huang, D., Dhariwal, P., Song, D., Sutskever, I.: GamePad: a learning environment for theorem proving. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, 6\u20139 May 2019. OpenReview.net (2019). https:\/\/openreview.net\/forum?id=r1xwKoR9Y7"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-81685-8_5","volume-title":"Computer Aided Verification","author":"S Itzhaky","year":"2021","unstructured":"Itzhaky, S., Peleg, H., Polikarpova, N., Rowe, R.N.S., Sergey, I.: Deductive synthesis of programs with pointers: techniques, challenges, opportunities. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021, Part I. LNCS, vol. 12759, pp. 110\u2013134. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_5"},{"key":"8_CR6","unstructured":"Kaliszyk, C., Chollet, F., Szegedy, C.: HolStep: a machine learning dataset for higher-order logic theorem proving. In: 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, 24\u201326 April 2017, Conference Track Proceedings. OpenReview.net (2017). https:\/\/openreview.net\/forum?id=ryuxYmvel"},{"key":"8_CR7","unstructured":"Kaliszyk, C., Urban, J., Michalewski, H., Ols\u00e1k, M.: Reinforcement learning of theorem proving. In: Bengio, S., Wallach, H.M., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, Montr\u00e9al, Canada, 3\u20138 December 2018, pp. 8836\u20138847 (2018). https:\/\/proceedings.neurips.cc\/paper\/2018\/hash\/55acf8539596d25624059980986aaa78-Abstract.html"},{"key":"8_CR8","unstructured":"Klein, G., Nipkow, T., Paulson, L., Thiemann, R.: The Archive of Formal Proofs (2004). https:\/\/www.isa-afp.org\/"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Koza, J.R.: Genetic Programming - On the Programming of Computers by Means of Natural Selection. Complex Adaptive Systems. MIT Press, Cambridge (1993)","DOI":"10.1007\/BF00175355"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-34175-6_14","volume-title":"Programming Languages and Systems","author":"Y Nagashima","year":"2019","unstructured":"Nagashima, Y.: LiFtEr: language to encode induction heuristics for Isabelle\/HOL. In: Lin, A.W. (ed.) APLAS 2019. LNCS, vol. 11893, pp. 266\u2013287. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34175-6_14"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Nagashima, Y.: Towards evolutionary theorem proving for Isabelle\/HOL. In: L\u00f3pez-Ib\u00e1\u00f1ez, M., Auger, A., St\u00fctzle, T. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, Prague, Czech Republic, 13\u201317 July 2019, pp. 419\u2013420. ACM (2019). https:\/\/doi.org\/10.1145\/3319619.3321921","DOI":"10.1145\/3319619.3321921"},{"key":"8_CR12","unstructured":"Nagashima, Y.: Definitional quantifiers realise semantic reasoning for proof by induction. CoRR abs\/2010.10296 (2020). https:\/\/arxiv.org\/abs\/2010.10296"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-030-53518-6_21","volume-title":"Intelligent Computer Mathematics","author":"Y Nagashima","year":"2020","unstructured":"Nagashima, Y.: Simple dataset for proof method recommendation in Isabelle\/HOL. In: Benzm\u00fcller, C., Miller, B. (eds.) CICM 2020. LNCS (LNAI), vol. 12236, pp. 297\u2013302. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53518-6_21"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Nagashima, Y.: Smart induction for Isabelle\/HOL (tool paper). In: 2020 Formal Methods in Computer Aided Design, FMCAD 2020, Haifa, Israel, 21\u201324 September 2020, pp. 245\u2013254. IEEE (2020). https:\/\/doi.org\/10.34727\/2020\/isbn.978-3-85448-042-6_32","DOI":"10.34727\/2020\/isbn.978-3-85448-042-6_32"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Nagashima, Y.: Faster smarter proof by induction in Isabelle\/HOL. In: Zhou, Z. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event \/ Montreal, Canada, 19-27 August 2021, pp. 1981\u20131988. ijcai.org (2021). https:\/\/doi.org\/10.24963\/ijcai.2021\/273","DOI":"10.24963\/ijcai.2021\/273"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Nagashima, Y., He, Y.: PaMpeR: proof method recommendation system for Isabelle\/HOL. In: Huchard, M., K\u00e4stner, C., Fraser, G. (eds.) Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France, 3\u20137 September 2018, pp. 362\u2013372. ACM (2018). https:\/\/doi.org\/10.1145\/3238147.3238210","DOI":"10.1145\/3238147.3238210"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-319-63046-5_32","volume-title":"Automated Deduction \u2013 CADE 26","author":"Y Nagashima","year":"2017","unstructured":"Nagashima, Y., Kumar, R.: A proof strategy language and proof script generation for Isabelle\/HOL. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 528\u2013545. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_32"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Nawaz, M.Z., Hasan, O., Nawaz, M.S., Fournier-Viger, P., Sun, M.: Proof searching in HOL4 with genetic algorithm. In: Hung, C., Cern\u00fd, T., Shin, D., Bechini, A. (eds.) SAC 2020: The 35th ACM\/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30\u2013April 3 2020, pp. 513\u2013520. ACM (2020). https:\/\/doi.org\/10.1145\/3341105.3373917","DOI":"10.1145\/3341105.3373917"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Polikarpova, N., Sergey, I.: Structuring the synthesis of heap-manipulating programs. Proc. ACM Program. Lang. 3(POPL), 72:1\u201372:30 (2019). https:\/\/doi.org\/10.1145\/3290385","DOI":"10.1145\/3290385"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement learning: an introduction. IEEE Trans. Neural Netw. 9(5), 1054\u20131054 (1998). https:\/\/doi.org\/10.1109\/TNN.1998.712192","DOI":"10.1109\/TNN.1998.712192"},{"key":"8_CR21","unstructured":"Yang, K., Deng, J.: Learning to prove theorems via interacting with proof assistants. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning, ICML 2019, Long Beach, California, USA, 9\u201315 June 2019. Proceedings of Machine Learning Research, vol.\u00a097, pp. 6984\u20136994. PMLR (2019). http:\/\/proceedings.mlr.press\/v97\/yang19a.html"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42441-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T16:05:57Z","timestamp":1693325157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42441-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031424403","9783031424410"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42441-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FSEN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamentals of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tehran","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iran","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":"4 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fsen2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fsen.ir\/2023\/Default.aspx","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":"19","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":"9","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":"2","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":"47% - 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":"2","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)"}}]}}