There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.startPage | 106865 | - |
dc.citation.title | INFORMATION AND SOFTWARE TECHNOLOGY | - |
dc.citation.volume | 146 | - |
dc.contributor.author | Yi, Jooyong | - |
dc.contributor.author | Ismayilzada, Elkhan | - |
dc.date.accessioned | 2023-12-21T14:09:47Z | - |
dc.date.available | 2023-12-21T14:09:47Z | - |
dc.date.created | 2022-03-04 | - |
dc.date.issued | 2022-06 | - |
dc.description.abstract | Context: Constraint-based program repair has been developed as one of the main techniques for automated program repair. Given a buggy program and a test suite, constraint-based program repair first extracts a repair constraint φ, and then synthesizes a patch satisfying φ. Since a patch is synthesized in a correct-by-construction manner (rather than compiling and testing each repair candidate source code), the constraint-based approach, in theory, requires less runtime overhead than the G&V approach. Nevertheless, the performance of existing constraint-based approaches is still suboptimal. Objective: In this work, we propose a novel technique to expedite constraint-based program repair. We aim to boost runtime performance without sacrificing repairability and patch quality. Method: The existing constraint-based program repair searches for a patch specification in an unguided manner. We introduce a novel guided search algorithm based on MCMC sampling. Results: Our experimental results for the 50 buggy versions of 5 real-world subjects (i.e., LIBTIFF, PHP, GMP, GZIP, and WIRESHARK) show that our method named FANGELIX is on average an order of magnitude faster than ANGELIX (a state-of-the-art constraint-based program repair tool), showing up to 23 times speed-up. This speed-up is achieved without sacrificing repairability and patch quality. Conclusion: This paper proposes a novel technique that expedites constraint-based program repair, using a search-based technique based on MCMC sampling. Our experimental results show the promise of our approach. | - |
dc.identifier.bibliographicCitation | INFORMATION AND SOFTWARE TECHNOLOGY, v.146, pp.106865 | - |
dc.identifier.doi | 10.1016/j.infsof.2022.106865 | - |
dc.identifier.issn | 0950-5849 | - |
dc.identifier.scopusid | 2-s2.0-85124470524 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/57361 | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0950584922000337?via%3Dihub | - |
dc.identifier.wosid | 000780387700004 | - |
dc.language | 영어 | - |
dc.publisher | ELSEVIER | - |
dc.title | Speeding up constraint-based program repair using a search-based technique | - |
dc.type | Article | - |
dc.description.isOpenAccess | FALSE | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems;Computer Science, Software Engineering | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.type.docType | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Automated program repair | - |
dc.subject.keywordAuthor | Constraint-based program repair | - |
dc.subject.keywordAuthor | Guided search | - |
dc.subject.keywordAuthor | MCMC sampling | - |
dc.subject.keywordPlus | AUTOMATED REPAIR | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.