Proving non-termination

The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of verification tools. While this is well-understood in safety verification, the current focus of liveness verification has been almost exclusively on the search for termination proofs. A counterexample to termination is an infinite program execution. In this paper, we propose a method to search for such counterexamples. The search proceeds in two phases. We first dynamically enumerate lasso-shaped candidate paths for counterexamples, and then statically prove their feasibility. We illustrate the utility of our nontermination prover, called TNT, on several nontrivial examples, some of which require bit-level reasoning about integer representations.

Published in:
Acm Sigplan Notices, 43, 147-158
Presented at:
35th Annual ACM SIGPLAN/SIGACT Symposium on Principles of Programming Language, San Francisco, CA, Jan 10-12, 2008

 Record created 2010-11-30, last modified 2018-03-17

Rate this document:

Rate this document:
(Not yet reviewed)