Bertolini, Cristiano; Schäf, Martin; Schweitzer, Pascal
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection of all infeasible code in a program. We first translate the task of determining all infeasible code into the problem of finding all statements that can be covered by a feasible path. We prove that in order to identify all coverable statements, it is sufficient to find all coverable statements within a certain minimal...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.