The paper outlines a prototype or method for pruning infeasible paths in path-bi

Question

The paper outlines a prototype or method for pruning infeasible paths in path-biased random testing which is helpful in eliminating useless and unexploitable drawings. It utilizes graph transformation to preserve the actual behavior of the program. The prototype improves the control flow graph of a program and builds a transformed graph with fewer infeasible paths. Further, the prototype is driven by symbolic execution and constraint solving that use detection of subsumptions and the abstract-check-refine paradigm to determine the infeasibility of some paths including cyclic paths.

What do you think based on Software testing?

Explanation / Answer

The major challenge in the field of symbolic execution is not the enormous amount of programs paths but the smallest programs, which are usually exponential in terms of static branches in the code.

As a result, given a fixed time budget, it is very crucial to explore the most relevant paths first.

Symbolic execution helps filtering out all paths which do not depend on the symbolic input.

It also detects those which are infeasible given the current path constraints.

Despite this filtering, path explosion represents one of the biggest problems faced by symbolic execution.

There are two key approaches that have been used to address this problem:

(i) heuristically prioritizing the exploration of the most promising paths

(ii) sound program analysis techniques to reduce the complexity of the path exploration.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.