Enhancing Dynamic Symbolic Execution by Automatically Learning Search Heuristics
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cha, Sooyoung | - |
dc.contributor.author | Hong, Seongjoon | - |
dc.contributor.author | Bak, Jiseong | - |
dc.contributor.author | Kim, Jingyoung | - |
dc.contributor.author | Lee, Junhee | - |
dc.contributor.author | Oh, Hakjoo | - |
dc.date.accessioned | 2022-11-18T14:40:46Z | - |
dc.date.available | 2022-11-18T14:40:46Z | - |
dc.date.created | 2022-11-17 | - |
dc.date.issued | 2022-09-01 | - |
dc.identifier.issn | 0098-5589 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/145767 | - |
dc.description.abstract | We present a technique to automatically generate search heuristics for dynamic symbolic execution. A key challenge in dynamic symbolic execution is how to effectively explore the program's execution paths to achieve high code coverage in a limited time budget. Dynamic symbolic execution employs a search heuristic to address this challenge, which favors exploring particular types of paths that are most likely to maximize the final coverage. However, manually designing a good search heuristic is nontrivial and typically ends up with suboptimal and unstable outcomes. The goal of this paper is to overcome this shortcoming of dynamic symbolic execution by automatically learning search heuristics. We define a class of search heuristics, namely a parametric search heuristic, and present an algorithm that efficiently finds an optimal heuristic for each subject program. Experimental results with industrial-strength symbolic execution tools (e.g., KLEE) show that our technique can successfully generate search heuristics that significantly outperform existing manually-crafted heuristics in terms of branch coverage and bug-finding. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.subject | GENERATION | - |
dc.title | Enhancing Dynamic Symbolic Execution by Automatically Learning Search Heuristics | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Oh, Hakjoo | - |
dc.identifier.doi | 10.1109/TSE.2021.3101870 | - |
dc.identifier.scopusid | 2-s2.0-85112590797 | - |
dc.identifier.wosid | 000854591500025 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, v.48, no.9, pp.3640 - 3663 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | - |
dc.citation.title | IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | - |
dc.citation.volume | 48 | - |
dc.citation.number | 9 | - |
dc.citation.startPage | 3640 | - |
dc.citation.endPage | 3663 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | GENERATION | - |
dc.subject.keywordAuthor | Testing | - |
dc.subject.keywordAuthor | Heuristic algorithms | - |
dc.subject.keywordAuthor | Tools | - |
dc.subject.keywordAuthor | Software testing | - |
dc.subject.keywordAuthor | Search problems | - |
dc.subject.keywordAuthor | Open source software | - |
dc.subject.keywordAuthor | Software algorithms | - |
dc.subject.keywordAuthor | Dynamic symbolic execution | - |
dc.subject.keywordAuthor | concolic testing | - |
dc.subject.keywordAuthor | execution-generated testing | - |
dc.subject.keywordAuthor | search heuristics | - |
dc.subject.keywordAuthor | software testing | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.