@inproceedings{61ac041b772b41fc84022d7d6e4ba6b8,
title = "Path Exploration Based on Monte Carlo Tree Search for Symbolic Execution",
abstract = "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.",
keywords = "Monte Carlo tree search, path exploration, software testing, symbolic execution, upper-confidence bounds for trees",
author = "Yeh, {Chao Chun} and Lu, {Han Lin} and Yeh, {Jia Jun} and Shih-Kun Huang",
year = "2018",
month = may,
day = "9",
doi = "10.1109/TAAI.2017.26",
language = "English",
series = "Proceedings - 2017 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "33--37",
booktitle = "Proceedings - 2017 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2017",
address = "美國",
note = "2017 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2017 ; Conference date: 01-12-2017 Through 03-12-2017",
}