Abstracting Path Conditions for Effective Symbolic Execution

Details Abstracting Path Conditions for Effective Symbolic Execution Abstracting Path Conditions for Effective Symbolic Execution

2011-12-20

arxiv.org/abs/1112.4703v1

Computer Science

Symbolic Computation

Scientific paper

We present an algorithm for tests generation tools based on symbolic execution. The algorithm is supposed to help in situations, when a tool is repeatedly failing to cover some code by tests. The algorithm then provides the tool a necessary condition strongly narrowing space of program paths, which must be checked for reaching the uncovered code. We also discuss integration of the algorithm into the tools and we provide experimental results showing a potential of the algorithm to be valuable in the tools, when properly implemented there.

Affiliated with

Also associated with

No associations

Rating

Abstracting Path Conditions for Effective Symbolic Execution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Abstracting Path Conditions for Effective Symbolic Execution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abstracting Path Conditions for Effective Symbolic Execution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-58231