Path Exploration Based on Monte Carlo Tree Search for Symbolic Execution

檔案

本條目沒有附加檔案。

日期

2017-01-01

期刊名稱

2017 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI)

卷期與頁次

頁 33–37

ISSN

2376-6816

語言

英文

摘要

Symbolic Execution is a widely used technique for program testing and analysis. When a program executes a trace symbolically, it simulates all possible paths. This results in an exponential growth of the number of states within the problem, which is commonly referred to as "path explosion." We therefore propose novel strategies that only require limited resources to give priority to more valuable paths. In this paper, we utilize a method based on the Monte Carlo tree search (MCTS) strategy to resolve the problem. We then compare the proposed MCTS-based strategy with other methods such as depth-first search (DFS) and breadth-first search (BFS). We also perform different scales of experiments based on time and space resource constraints. For smaller test cases, we found that MCTS performs on average 1.4 times better than BFS and DFS in terms of the block discovery rate. In addition, for larger test cases, MCTS performs on average 2.8 times better than DFS and BFS in terms of the block discovery rate.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Yeh, C.-C., Lu, H.-L., Yeh, J.-J., & Huang, S.-K. (2017). Path Exploration Based on Monte Carlo Tree Search for Symbolic Execution. 2017 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 33–37. https://ir.lib.nycu.edu.tw/handle/11536/146163

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/146163