{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233368","sets":["581:11492:11495"]},"path":["11495"],"owner":"44499","recid":"233368","title":["自動プログラム生成におけるプログラム依存を考慮した交叉の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-15"},"_buckets":{"deposit":"f6bcc64e-fbc3-4461-a124-2422c812af1c"},"_deposit":{"id":"233368","pid":{"type":"depid","value":"233368","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"自動プログラム生成におけるプログラム依存を考慮した交叉の提案","author_link":["633747","633736","633740","633737","633746","633742","633743","633744","633738","633749","633745","633739","633748","633741"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"自動プログラム生成におけるプログラム依存を考慮した交叉の提案"},{"subitem_title":"Program Slice-based Crossoverfor Automated Program Genration","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[一般論文] 自動プログラム生成，自動プログラム修正，交叉，プログラムスライス","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2024-03-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"日本電信電話株式会社"},{"subitem_text_value":"日本電信電話株式会社"},{"subitem_text_value":"日本電信電話株式会社"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Nippon Telegraph and Telephone Corporation","subitem_text_language":"en"},{"subitem_text_value":"Nippon Telegraph and Telephone Corporation","subitem_text_language":"en"},{"subitem_text_value":"Nippon Telegraph and Telephone Corporation","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/233368/files/IPSJ-JNL6503015.pdf","label":"IPSJ-JNL6503015.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL6503015.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"4797a386-e951-4c8a-b7a4-b75cc334ee43","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"渡辺, 大登"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"柗本, 真佑"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"肥後, 芳樹"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"楠本, 真二"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"倉林, 利行"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"切貫, 弘之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"丹野, 治門"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroto, Watanabe","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shinsuke, Matsumoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yoshiki, Higo","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shinji, Kusumoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toshiyuki, Kurabayashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroyuki, Kirinuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Haruto, Tanno","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_publisher_15":{"attribute_name":"公開者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"自動でプログラムを生成する技術の実現手法として，遺伝的アルゴリズム（GA）を用いた生成と検証に基づく手法が提案されている．この手法では，テストケースを入力として受け取り，プログラムの改変と評価を繰り返して全テストケースに通過するプログラムの生成を試みる．GAにおけるプログラム改変の方法は変異と交叉に大別される．このうち，交叉は過去の改変履歴の一部を再利用する操作であり，一点交叉や一様交叉などの生物を模した方法がある．しかし，これら既存の交叉はプログラム内の依存関係を破壊し，構文的意味的に誤ったプログラムを生成するという問題がある．そこで本研究ではプログラムの依存関係をあらかじめ解析し，依存関係を破壊しない新たな交叉手法を提案する．評価実験として，プログラミングコンテストの問題80問を対象とした適用実験を行った結果，既存の交叉と比べた生成効率の向上を確認した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"As a method for realizing the technology of automatic program generation, there is an approach based on the generation and verification using genetic algorithm (GA). In this method, it receives test cases as inputs and attempts to generate a program that passes all test cases by repeating modification and evaluation of the program. In GA, there are two types of program modifications: mutation and crossover. Crossover reuses part of the past modification history, and there are methods modeled after organisms such as single-point crossover and uniform crossover. However, these existing crossovers have the problem of generating syntactically and semantically incorrect programs by breaking the dependencies within the program. Therefore, in this research, we propose a new crossover method that pre-analyzes the dependencies of the program and does not break the dependencies. As an evaluation experiment, we conducted an application experiment targeting 80 programming contest problems and confirmed an improvement in generation efficiency compared to existing crossovers.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"728","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"718","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"65"}]},"relation_version_is_last":true,"item_2_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.20729/00233254","subitem_identifier_reg_type":"JaLC"}]},"weko_creator_id":"44499"},"id":233368,"updated":"2025-01-19T10:01:54.524574+00:00","links":{},"created":"2025-01-19T01:34:46.114167+00:00"}