IEEE/ICACT20260382 Slide.09        [Big Slide]       Oral Presentation
Here, we can compare a feasible path with an infeasible one. In the first example, the highlighted lines show a clear, valid route to line 6. However, in the second example, line 5 is unreachable because the conditions on lines 3 and 4 are logically contradictory. Our primary goal is to use symbolic execution to determine path feasibility.

[Go to Next Slide]
Select Voice: