Reachable Code Problem

computation

Definition

Reachable Code Problem

The reachable code problem is a decision problem that asks, for a given program $\Pi$ and a natural number $n$, whether there exists an input $i$ for program $\Pi$ such that the code with line number $n$ is executed when running $\Pi$ with input $I$.