File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이주용

Yi, Jooyong
Programming Languages and Software Engineering Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace IT -
dc.citation.endPage 324 -
dc.citation.startPage 312 -
dc.citation.title International Conference in Software Engineering for Defence Applications -
dc.contributor.author Yi, Jooyong -
dc.date.accessioned 2023-12-19T15:48:24Z -
dc.date.available 2023-12-19T15:48:24Z -
dc.date.created 2019-06-07 -
dc.date.issued 2018-06-07 -
dc.description.abstract Automated program repair has made major strides showing its exciting potential, but all efforts to turn the techniques into practical tools usable by software developers hit a crucial blocking factor: the timing issue. Today’s techniques are slow. Too slow by an order of magnitude at least. The long response time implies that the currently available techniques cannot suit the actual needs of developers in the field. What developers want is a tool that can instantaneously propose a fix for a detected failure. A technique that can propose a patch instantaneously (or near-instantaneously) would provide the breakthrough that is required to turn automated program repair from an attractive research topic into a practical software engineering tool. Indeed, researchers have started to tackle this speed issue. In this paper, we survey recent approaches that were shown to be effective in speeding up automated program repair. In particular, we view automated program repair as a search problem—the ultimate goal of automated program repair is the search for a patch which is often preceded by other related searches such as a search for suspicious program locations, and a search for the specification for a patch. We describe how the problem of automated program repair has been decomposed into a series of search problems, and explain how these individual search problems have been solved. We expect that our paper would provide insight into how to speed up automated program repair by further optimizing the search for a patch. -
dc.identifier.bibliographicCitation International Conference in Software Engineering for Defence Applications, pp.312 - 324 -
dc.identifier.doi 10.1007/978-3-030-14687-0_28 -
dc.identifier.scopusid 2-s2.0-85064158116 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/34940 -
dc.identifier.url https://link.springer.com/chapter/10.1007%2F978-3-030-14687-0_28 -
dc.publisher SEDA 2018 -
dc.title On the Time Performance of Automated Fixes -
dc.type Conference Paper -
dc.date.conferenceDate 2018-06-07 -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.