A Heuristic Approach to Verifying the Termination of Linear Programs

In this paper, we present a new heuristic approach to verifying termination of linear programs by computing difference operators. We get the conclusion that only if the difference operator after finite difference is a constant, then termination of the program is decidable. Even we can obtain the preconditions of program's termination.