Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Symbolic execution is a porful technique for systematically exploring the paths of a program and generating the corresponding test inputs. Hover, its practical usage is often limited by the  path explosion  problem, that is, the number of explored paths usually grows exponentially with the increase of program size. ,  argue that for the purpose of fault detection it is not necessary to systematically explore the paths, and propose a new symbolic execution approach to mitigate the path explosion problem by predicting and eliminating the redundant paths based on symbolic value. Our approach can achieve the equivalent fault detection capability as traditional symbolic execution without exhaustive path exploration. In addition,  develop a practical implementation called Dependence Guided Symbolic Execution (DGSE) to soundly approximate our approach. Through exploiting program dependence, DGSE can predict and eliminate the redundant paths at a reasonable computational cost. Our empirical study shows that the redundant paths are abundant and widespread in a program. Compared with traditional symbolic execution, DGSE only explores 6.96 to 96.57 percent of the paths and achieves a speedup of 1.02   $\times$       to 49.56  $\times$      .  have released our tool and the benchmarks used to evaluate DGSE  $^\ast$      .
['Haijun Wang', 'Ting Liu', 'Xiaohong Guan', 'Chao Shen', 'Qinghua Zheng', 'Zijiang Yang']
I am writing a research paper on a idea Dependence Guided Symbolic Execution
[{"from": "human", "value": "I am writing a research paper on a idea Dependence Guided Symbolic Execution"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Symbolic execution is a porful technique for systematically exploring the paths of a program and generating the corresponding test inputs. Hover, its practical usage is often limited by the  path explosion  problem, that is, the number of explored paths usually grows exponentially with the increase of program size. ,  argue that for the purpose of fault detection it is not necessary to systematically explore the paths, and propose a new symbolic execution approach to mitigate the path explosion problem by predicting and eliminating the redundant paths based on symbolic value. Our approach can achieve the equivalent fault detection capability as traditional symbolic execution without exhaustive path exploration. In addition,  develop a practical implementation called Dependence Guided Symbolic Execution (DGSE) to soundly approximate our approach. Through exploiting program dependence, DGSE can predict and eliminate the redundant paths at a reasonable computational cost. Our empirical study shows that the redundant paths are abundant and widespread in a program. Compared with traditional symbolic execution, DGSE only explores 6.96 to 96.57 percent of the paths and achieves a speedup of 1.02   $\\times$       to 49.56  $\\times$      .  have released our tool and the benchmarks used to evaluate DGSE  $^\\ast$      ."}]