Kusumoto Laboratory: H. Yokoyama, Y. Higo, K. Hotta, T. Ohta, K. Okano, , and S. Kusumoto, Toward Improving Ability to Repair Bugs Automatically –A Patch Candidate Location Mechanism Using Code Similarity–, April 2016.
  • リスト
  •  表 
  • LaTeX
  • BibTeX
Detail of a work
Tweet
H. Yokoyama, Y. Higo, K. Hotta, T. Ohta, K. Okano, , and S. Kusumoto, "Toward Improving Ability to Repair Bugs Automatically –A Patch Candidate Location Mechanism Using Code Similarity–," In 31st ACM Symposium on Applied Computing, pp. 1364-1370, April 2016.
ID 282
分類 国際会議
タグ Automated program repair Source code analysis Genetic programming
表題 (title) Toward Improving Ability to Repair Bugs Automatically –A Patch Candidate Location Mechanism Using Code Similarity–
表題 (英文)
著者名 (author) Haruki Yokoyama,Yoshiki Higo,Keisuke Hotta,Takafumi Ohta,Kozo Okano,,Shinji Kusumoto
英文著者名 (author) Haruki Yokoyama,Yoshiki Higo,Keisuke Hotta,Takafumi Ohta,Kozo Okano,,Shinji Kusumoto
編者名 (editor)
編者名 (英文)
キー (key) Haruki Yokoyama,Yoshiki Higo,Keisuke Hotta,Takafumi Ohta,Kozo Okano,,Shinji Kusumoto
書籍・会議録表題 (booktitle) 31st ACM Symposium on Applied Computing
書籍・会議録表題(英文)
巻数 (volume)
号数 (number)
ページ範囲 (pages) 1364-1370
組織名 (organization)
出版元 (publisher)
出版元 (英文)
出版社住所 (address)
刊行月 (month) 4
出版年 (year) 2016
採択率 (acceptance)
URL
付加情報 (note)
注釈 (annote)
内容梗概 (abstract) Automated program repair is a promising way to reduce costs on
program debugging dramatically. Some repair techniques with genetic
algorithm have been proposed, and they were able to fix several
dozen of actual bugs in open source software. However, existing
techniques occasionally take a long time to generate a repaired
version of a given program. The dominant factor for that is generating
so many programs that do not pass given test cases. In this research,
we are trying to generate a repaired program, which passes
all the test cases, in less time. Our key idea is using code similarity
to select code lines to be inserted into a given program. More
concretely, we propose to select code lines in code regions similar
to the faulty code regions. In existing techniques, code lines for insertion
are randomly selected from a given program. Currently, we
are still in an early stage of this research. In this paper, we report
some promising results of our pilot study, which show that using
code similarity is very effective to generate repaired programs in
less time.
論文電子ファイル y-haruki_SAC2016.pdf (application/pdf) [一般閲覧可]
BiBTeXエントリ
@inproceedings{id282,
         title = {Toward Improving Ability to Repair Bugs Automatically –A Patch Candidate Location Mechanism Using Code Similarity–},
        author = {Haruki Yokoyama and Yoshiki Higo and Keisuke Hotta and Takafumi Ohta and Kozo Okano and  and Shinji Kusumoto},
     booktitle = {31st ACM Symposium on Applied Computing},
         pages = {1364-1370},
         month = {4},
          year = {2016},
}
  

Search

Tags

1 件の該当がありました. : このページのURL : HTML

Language: 英語 | 日本語 || ログイン |

This site is maintained by fenrir.
PMAN 3.2.10 build 20181029 - Paper MANagement system / (C) 2002-2016, Osamu Mizuno
Time to show this page: 0.034992 seconds.