earticle

논문검색

A Method of Path Feasibility Judgment Based on Symbolic Execution and Range Analysis

초록

영어

In program testing, the accurate information of path feasibility can improve the efficiency of static analysis. The dynamic judgment method of path feasibility needs to execute program, and the resultis usually not sound. On the basis of symbolic execution, this paper proposes a new static judgmentmethod, whichsimultaneouslycomputes two interval sets of each symbolic variable: possible value set and necessary value set. According to these range information, we can easily give the definitejudgment of a path: feasible, infeasible or uncertain. Experiment shows that the method is appropriate and efficient in case of the weakly relevant input.

목차

Abstract
 1. Introduction
 2. Possible Value Set and Necessary Value Set
 3. The Method of Path Feasibility Judgment
 4. Experiment
 5. Conclusion
 Acknowledgement
 References

저자정보

  • Ya-Wen Wang State Key Laboratory of Networking and SwitchingTechnology,Beijing University of Posts andTelecommunications,Beijing, China, State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
  • Ying Xing State Key Laboratory of Networking and SwitchingTechnology,Beijing University of Posts andTelecommunications,Beijing, China, Liaoning Technical University, Huludao, China
  • Xu-Zhou Zhang State Key Laboratory of Networking and SwitchingTechnology,Beijing University of Posts andTelecommunications,Beijing, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.